Continuous maximin knapsack problems with GLB constraints
- 1 October 1986
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 36 (1) , 114-121
- https://doi.org/10.1007/bf02591994
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An O(n) algorithm for the multiple-choice knapsack linear programMathematical Programming, 1984
- Technical Note—On Min-Max Integer Allocation ProblemsOperations Research, 1984
- Linear max-min programmingMathematical Programming, 1981
- A note of the knapsack problem with special ordered setsOperations Research Letters, 1981
- The Linear Multiple Choice Knapsack ProblemOperations Research, 1980
- A o(n logn) algorithm for LP knapsacks with GUB constraintsMathematical Programming, 1979
- The Multiple-Choice Knapsack ProblemOperations Research, 1979
- THE MULTIPLE-CHOICE KNAPSACK PROBLEMJournal of the Operations Research Society of Japan, 1978
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource AllocationOperations Research, 1974