The 0–1 knapsack problem with multiple choice constraints
- 31 March 1978
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 2 (2), 125-131
- https://doi.org/10.1016/0377-2217(78)90108-x
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- An Efficient Algorithm for the 0-1 Knapsack ProblemManagement Science, 1976
- A branch and bound algorithm for the generalized assignment problemMathematical Programming, 1975
- Reduction Algorithm for Zero-One Single Knapsack ProblemsManagement Science, 1973
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972