A Computational Study of Search Strategies for Mixed Integer Programming
作者： J. T. Linderoth , M. W. P. Savelsbergh
关键词: Computer science 、 Theoretical computer science 、 Linear programming 、 Procedural programming 、 Branch and bound 、 Variety (cybernetics) 、 Reactive programming 、 Inductive programming 、 Integer programming 、 Branch and price
摘要: The branch-and-bound procedure for solving mixed integer programming (MIP) problems using linear programming relaxations has been used with great success for decades. Over the years, a variety of researchers have studied ways of making the basic algorithm more effective. Breakthroughs in the fields of computer hardware, computer software, and mathematics have led to increasing success at solving larger and larger MIP instances. The goal of this article is to survey many of the results regarding branch-and-bound search …
core.ac.uk
sci-hub.se 参考文章(33)
Raymond Breu, Claude-Alain Burdet, Branch and bound experiments in zero-one programming Approaches to Integer Programming. pp. 1- 50 ,(1974) , 10.1007/BFB0120687
M.W.P. Savelsbergh, R.E. Bixby, S. Ceria, C.M. McZeal, An Updated Mixed Integer Programming Library: MIPLIB 3.0 ,(1998)
Sartaj Sahni, Ten-Hwang Lai, Anomalies in Parallel Branch-and-Bound Algorithms. international conference on parallel processing. pp. 183- 190 ,(1983)
E.M.L. Beale, Branch and Bound Methods for Mathematical Programming Systems Annals of discrete mathematics. ,vol. 5, pp. 201- 219 ,(1979) , 10.1016/S0167-5060(08)70351-0
A. Land, S. Powell, Computer Codes for Problems of Integer Programming Annals of discrete mathematics. ,vol. 5, pp. 221- 269 ,(1979) , 10.1016/S0167-5060(08)70352-2
George L. Nemhauser, Martin W.P. Savelsbergh, Gabriele C. Sigismondi, Software section: MINTO, a mixed INTeger optimizer Operations Research Letters. ,vol. 15, pp. 47- 58 ,(1994) , 10.1016/0167-6377(94)90013-2
Norman J. Driebeek, An Algorithm for the Solution of Mixed Integer Programming Problems Management Science. ,vol. 12, pp. 576- 587 ,(1966) , 10.1287/MNSC.12.7.576
M. Benichou, J. M. Gauthier, P. Girodet, G. Hentges, G. Ribiere, O. Vincent, Experiments in mixed-integer linear programming Mathematical Programming. ,vol. 1, pp. 76- 94 ,(1971) , 10.1007/BF01584074
Jonathan Eckstein, Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 Siam Journal on Optimization. ,vol. 4, pp. 794- 814 ,(1994) , 10.1137/0804046
W. C. Healy, Multiple Choice Programming A Procedure for Linear Programming with Zero-One Variables Operations Research. ,vol. 12, pp. 122- 138 ,(1964) , 10.1287/OPRE.12.1.122