Experiments in integer programming
暂无分享,去创建一个
[1] Claude-Alain Burdet,et al. A Subadditive Approach to Solve Linear Integer Programs , 1977 .
[2] A. M. Geoffrion. Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .
[3] A. M. Geoffrion,et al. Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .
[4] Michael Grigoriadis,et al. APOSS: a partial order in the solution space of bivalent programs , 1974, SMAP.
[5] Gautam Mitra. Investigation of some branch and bound strategies for the solution of mixed integer linear programs , 1973, Math. Program..
[6] Kurt Spielberg,et al. Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..
[7] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[8] U. Suhl. Implementationstechniken für einen Branch-and-Bound-Algorithmus zur Lösung von (0–1)-Programmen , 1978 .
[9] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .
[10] Egon Balas,et al. Discrete Programming by the Filter Method , 1967, Oper. Res..
[11] R. Gomory. AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .
[12] James E. Kalan. Aspects of large-scale in-core linear programming , 1971, ACM '71.
[13] John J. H. Forrest,et al. Practical Solution of Large Mixed Integer Programming Problems with Umpire , 1974 .