A branch and bound algorithm for solving the multiple-choice knapsack problem
- 1 October 1984
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 11 (2) , 231-249
- https://doi.org/10.1016/0377-0427(84)90023-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A computational study of a multiple-choice knapsack algorithmACM Transactions on Mathematical Software, 1983
- The Linear Multiple Choice Knapsack ProblemOperations Research, 1980
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- A o(n logn) algorithm for LP knapsacks with GUB constraintsMathematical Programming, 1979
- The Multiple-Choice Knapsack ProblemOperations Research, 1979
- A mathematical programming system for preference and compatibility maximized menu planning and schedulingMathematical Programming, 1978
- The 0–1 knapsack problem with multiple choice constraintsEuropean Journal of Operational Research, 1978
- THE MULTIPLE-CHOICE KNAPSACK PROBLEMJournal of the Operations Research Society of Japan, 1978
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Branch and bound experiments in zero-one programmingPublished by Springer Nature ,1974