Zero-one programming with many variables and few constraints
暂无分享,去创建一个
A. L. Soyster | A. Soyster | B. Lev | W. Slivka | Ben Lev | W. Slivka
[1] Frederick S. Hillier,et al. Efficient Heuristic Procedures for Integer Linear Programming with an Interior , 1969, Oper. Res..
[2] Arthur M. Geoffrion,et al. An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..
[3] Gary A. Kochenberger,et al. Operations research for managerial decisions , 1972 .
[4] Harvey M. Salkin. Letter to the Editor - On the Merit of the Generalized Origin and Restarts in Implicit Enumeration , 1970, Oper. Res..
[5] Clifford C. Petersen,et al. Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .
[6] Robert G. Jeroslow,et al. Experimental results on Hillier's linear search , 1975, Math. Program..
[7] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .
[8] E. Balas,et al. Canonical Cuts on the Unit Hypercube , 1972 .
[9] H. Weingartner,et al. Mathematical Programming and the Analysis of Capital Budgeting Problems. , 1964 .