Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
暂无分享,去创建一个
[1] Kurt Spielberg,et al. Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..
[2] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .
[3] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .
[4] Laurence A. Wolsey,et al. Coefficient reduction for inequalities in 0–1 variables , 1974, Math. Program..
[5] K. Spielberg,et al. On a Production Allocation and Distribution Problem , 1978 .
[6] A. N. Elshafei,et al. Note--On the Use of Fictitious Bounds in Tree Search Algorithms , 1977 .
[7] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..
[8] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[9] P. S. Davis,et al. A branch‐bound algorithm for the capacitated facilities location problem , 1969 .
[10] P. Mevert,et al. Implicit Enumeration with Generalized Upper Bounds , 1977 .
[11] G. Ribiere,et al. Experiments in mixed-integer linear programming , 1971, Math. Program..
[12] A. M. Geoffrion,et al. Multicommodity Distribution System Design by Benders Decomposition , 1974 .
[13] J. Krarup,et al. Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .