Minmax linear knapsack problem with grouped variables and gub
From MaRDI portal
Publication:3835625
DOI10.1080/02331939308843905zbMath0818.90080MaRDI QIDQ3835625
S. K. Gupta, Abraham P. Punnen
Publication date: 17 August 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939308843905
linear time algorithm; grouped variables; knapsack sharing problem; continuous minmax knapsack; greatest upper bunds; minmax linear knapsack
90C10: Integer programming
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- A graphical method to solve a family of allocation problems
- A graphical method to solve a maximin allocation problem
- A note on the knapsack problem with special ordered sets
- Continuous maximin knapsack problems with GLB constraints
- AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
- An O(n) algorithm for the multiple-choice knapsack linear program
- A o(n logn) algorithm for LP knapsacks with GUB constraints
- The Knapsack Sharing Problem