A fast algorithm for the linear multiple-choice knapsack problem
- 31 October 1984
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 3 (4) , 205-209
- https://doi.org/10.1016/0167-6377(84)90027-0
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- An O(n) algorithm for the multiple-choice knapsack linear programMathematical Programming, 1984
- The complexity of selection and ranking in X + Y and matrices with sorted columnsJournal of Computer and System Sciences, 1982
- A note of the knapsack problem with special ordered setsOperations Research Letters, 1981
- The Linear Multiple Choice Knapsack ProblemOperations Research, 1980
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- The Multiple-Choice Knapsack ProblemOperations Research, 1979