Article ID: | iaor19991998 |
Country: | Canada |
Volume: | 36 |
Issue: | 4 |
Start Page Number: | 274 |
End Page Number: | 317 |
Publication Date: | Nov 1998 |
Journal: | INFOR |
Authors: | Lin Edward |
Keywords: | programming: integer, combinatorial analysis, programming: mathematical |
Knapsack problem and its generalizations have been intensively studied during the last three decades with a rich literature of research reports. Over the years, surveys and reviews have been conducted mostly on the standard knapsack problems, namely, the single-constraint linear model. This paper reports the solution approaches developed for some non-standard knapsack problems with wide range of applications through a bibliographical review. The non-standard knapsack problems reviewed in this paper include the multidimensional knapsack problem, the multiple-choice knapsack problem, the 0–1 multiple knapsack problem, the quadratic knapsack problem, the maximin knapsack problem and the collapsing knapsack problem. Features of the solution approaches for each type of these non-standard knapsack problems and the computational experience as reported in the literature are summarized into several concise tables to provide a quick and broad reference for future researches.