A minimal algorithm for the Multiple-choice Knapsack Problem

[1]  David Pisinger,et al.  An expanding-core algorithm for the exact 0-1 knapsack problem , 1995 .

[2]  David Pisinger,et al.  A Minimal Algorithm for the Bounded Knapsack Problem , 1995, IPCO.

[3]  S. Martello,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[4]  S. Martello,et al.  A New Algorithm for the 0-1 Knapsack Problem , 1988 .

[5]  M. E. Dyer,et al.  A branch and bound algorithm for solving the multiple-choice knapsack problem , 1984 .

[6]  Krzysztof Dudziski,et al.  A fast algorithm for the linear multiple-choice knapsack problem , 1984 .

[7]  Martin Dyer,et al.  AN O(n) ALGORITHM FOR THE MULTIPLE-CHOICE , 2007 .

[8]  Eitan Zemel,et al.  An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems , 1984, Inf. Process. Lett..

[9]  Ronald D. Armstrong,et al.  A computational study of a multiple-choice knapsack algorithm , 1983, TOMS.

[10]  Eitan Zemel,et al.  The Linear Multiple Choice Knapsack Problem , 1980, Oper. Res..

[11]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[12]  Prabhakant Sinha,et al.  The Multiple-Choice Knapsack Problem , 1979, Oper. Res..

[13]  R. Nauss.  The 0–1 knapsack problem with multiple choice constraints☆ , 1978 .

[14]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[15]  K. Dudzinski,et al.  Exact methods for the knapsack problem and its generalizations , 1987 .

[16]  C. Witzgall.  On One-Row Linear Programs , 1980 .