Bounded knapsack sharing
From MaRDI portal
Publication:1804651
DOI10.1007/BF01582227zbMATH Open0821.90098OpenAlexW2127568650MaRDI QIDQ1804651FDOQ1804651
Publication date: 15 May 1995
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582227
lower and upper boundsmultiple constraintsmaximin programmingbounded knapsack sharing problempiecewise linear tradeoff functionspreprocessor procedure
Cites Work
- A lexicographic minimax algorithm for multiperiod resource allocation
- The Knapsack Sharing Problem
- Resource allocation among competing activities: A lexicographic minimax approach
- An algorithm for separable nonlinear minimax problems
- The Linear Sharing Problem
- Solving knapsack sharing problems with general tradeoff functions
- A nonlinear minimax allocation problem with multiple knapsack constraints
- Minimax Resource Allocation with Tree Structured Substitutable Resources
- Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
Cited In (3)
Recommendations
- New upper bounds and exact methods for the knapsack sharing problem π π
- Knapsack cost sharing π π
- The knapsack sharing problem: an exact algorithm π π
- An exact algorithm for large knapsack sharing problems π π
- An exact algorithm for the knapsack sharing problem π π
- An efficient algorithm for the knapsack sharing problem π π
- An exact constructive algorithm for the knapsack sharing problem π π
- Solving knapsack sharing problems with general tradeoff functions π π
- An exact algorithm for the knapsack sharing problem with common items π π
- Heuristic and reduction algorithms for the knapsack sharing problem π π
This page was built for publication: Bounded knapsack sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804651)