A minimal algorithm for the multiple-choice knapsack problem
- 1 June 1995
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 83 (2) , 394-410
- https://doi.org/10.1016/0377-2217(95)00015-i
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Exact methods for the knapsack problem and its generalizationsPublished by Elsevier ,2011
- A New Algorithm for the 0-1 Knapsack ProblemManagement Science, 1988
- A fast algorithm for the linear multiple-choice knapsack problemOperations Research Letters, 1984
- A branch and bound algorithm for solving the multiple-choice knapsack problemJournal of Computational and Applied Mathematics, 1984
- An O(n) algorithm for the multiple-choice knapsack linear programMathematical Programming, 1984
- A computational study of a multiple-choice knapsack algorithmACM Transactions on Mathematical Software, 1983
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- QuicksortThe Computer Journal, 1962
- Discrete-Variable Extremum ProblemsOperations Research, 1957