论文信息 - AN O(n) ALGORITHM FOR THE MULTIPLE-CHOICE

AN O(n) ALGORITHM FOR THE MULTIPLE-CHOICE

An algorithm for solving the linear program associated with the multiple choice knapsack problem is described. The algorithm is shown to work in time linear in the number of variables. This improves the previously known best bound for this problem, and is optimal to within a constant factor.

Martin Dyer | M. Dyer

[1] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

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

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

[4] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[5] Fred W. Glover,et al. A o(n logn) algorithm for LP knapsacks with GUB constraints , 1979, Math. Program..

[6] T. Ibaraki,et al. THE MULTIPLE-CHOICE KNAPSACK PROBLEM , 1978 .

[7] Martin E. Dyer,et al. Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

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