An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- 30 March 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 18 (3) , 123-128
- https://doi.org/10.1016/0020-0190(84)90014-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On search over rationalsOperations Research Letters, 1981
- 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
- Rational searchInformation Processing Letters, 1979
- Efficient search for rationalsInformation Processing Letters, 1979
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $SIAM Journal on Computing, 1978