论文信息 - Resolution of the 0–1 knapsack problem: Comparison of methods - 字舞流文

Resolution of the 0–1 knapsack problem: Comparison of methods

A method of solving the 0–1 knapsack problem which derives from the “shrinking boundary method” is described and compared to other methods through extensive computational experimentation.

D. FAYARD | G. PLATEAU | G. Plateau | D. Fayard

[1] Egon Balas,et al. Discrete Programming by the Filter Method , 1967, Oper. Res..

[2] C. A. Trauth,et al. Integer Linear Programming: A Study in Computational Efficiency , 1969 .

[3] A. M. Geoffrion. Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[4] Roland Schinzinger,et al. A Shrinking Boundary Algorithm for Discrete System Models , 1970, IEEE Trans. Syst. Sci. Cybern..

[5] Arthur M. Geoffrion,et al. An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..

[6] H. Greenberg,et al. A Branch Search Algorithm for the Knapsack Problem , 1970 .

[7] Gordon H. Bradley,et al. Transformation of integer programs to knapsack problems , 1971, Discret. Math..

[8] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .