论文信息 - A fast algorithm for the linear multiple-choice knapsack problem - 字舞流文

A fast algorithm for the linear multiple-choice knapsack problem

A description of an algorithm for solving the linear multiple-choice knapsack problem is given. The algorithm has a convenient structure for a branch-and bound approach to the multiple-choice knapsack problem.

Krzysztof Dudziski | S. Walukiewicz | Krzysztof Dudziski | Stanisaw Walukiewicz

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] Donald B. Johnson,et al. The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns , 1982, J. Comput. Syst. Sci..

[3] Ellis L. Johnson,et al. A note of the knapsack problem with special ordered sets , 1981, Oper. Res. Lett..

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

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

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

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