An O(n) algorithm for the multiple-choice knapsack linear program
- 1 May 1984
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 29 (1) , 57-63
- https://doi.org/10.1007/bf02591729
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Linear Multiple Choice Knapsack ProblemOperations Research, 1980
- An Algorithm for Large Zero-One Knapsack ProblemsOperations 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
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970