Simple but efficient approaches for the collapsing knapsack problem
- 1 August 1997
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 77 (3) , 271-280
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A minimal algorithm for the multiple-choice knapsack problemEuropean Journal of Operational Research, 1995
- An exact algorithm for the 0–1 collapsing knapsack problemDiscrete Applied Mathematics, 1994
- A New Algorithm for the 0-1 Knapsack ProblemManagement Science, 1988
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- The Collapsing 0–1 Knapsack ProblemMathematical Programming, 1978