A Computational Study of Search Strategies for Mixed Integer Programming

References

• Bixby R. Personal Communication (1996) Google Scholar
• Beale E. M. L. , Hammer P. L. , Johnson E. L. , Korte B. H. Branch-and-bound methods for mathematical programming systems. Discrete Optimization II (1979) (North Holland Publishing Co., Amsterdam) Crossref, Google Scholar
• Beale E. M. L. , Forrest J. J. H. Global optimization using special ordered sets. Math. Programming (1976) 10 52 69 Crossref, Google Scholar
• Beale E. M. L. , Small R. E. Mixed integer programming by a branch-and-bound method. W. H. Kalenich, ed. Proc. IFIP congress 65 (1966) 2 Google Scholar
• Bénichou M. , Gauthier J. M. , Girodet P. , Hentges G. , Ribière G. , Vincent O. Experiments in mixed-integer linear programming. Math. Programming (1971) 1 76 94 Crossref, Google Scholar
• Bixby R. E. , Ceria S. , Mczeal C. M. , Savelsbergh M. W. P. An updated mixed integer programming library: MIPLIB 3.0. (1998) . Technical report TR98-03, Department of Computational and Applied Mathematics, Rice University, available from http://www.caam.rice.edu/bixby/miplib/miplib.html Google Scholar
• Breu R. , Burdet C. A. Branch-and-bound experiments in zero-one programming. Math. Programming (1974) 2 1 50 Crossref, Google Scholar
• CPLEX Optimization, Inc Using the CPLEX Callable Library (1995) Google Scholar
• Crowder H. , Johnson E. L. , Padberg M. W. Solving large scale zero-one linear programming problems. Oper. Res. (1983) 31 803 834 Link, Google Scholar
• Dakin R. J. A tree search algorithm for mixed programming problems. Comput. J. (1965) 8 250 255 Crossref, Google Scholar
• Davis R. E. , Kendrick D. A. , Weitzman M. A branch-and-bound algorithm for zero-one mixed integer programming problems. (1967) . Technical Report Development Economic Report 69, Center for International Affairs, Harvard University Google Scholar
• Driebeek N. J. An algorithm for the solution of mixed integer programming problems. Management Sci. (1966) 12 576 587 Link, Google Scholar
• Eckstein J. Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5. SIAM J. Optim. (1994) 4 794 814 Crossref, Google Scholar
• Forrest J. J. H. , Hirst J. P. H. , Tomlin J. A. Practical solution of large scale mixed integer programming problems with UMPIRE. Management Sci. (1974) 20 736 773Link, Google Scholar
• Gauthier J. M. , Ribière G. Experiments in mixed-integer linear programming using pseudocosts. Math. Programming (1977) 12 26 47 Crossref, Google Scholar
• Geoffrion A. M. , Marsten R. E. Integer programming algorithms: A framework and state-of-the-art survey. Management Sci. (1972) 18 465 491 Link, Google Scholar
• Gu Z. , Nemhauser G. L. , Savelsbergh M. W. P. Cover inequalities for 0-1 linear programs: Computation. INFORMS J. Comput. (1998) 10 427 437 Link, Google Scholar
• Günlùk O. A branch-and-cut algorithm for capacitated network design problems. (1996) . Unpublished Manuscript Google Scholar
• Hajian M. T. , Mitra G. Design and testing of an integrated branch-and-bound algorithm for piecewise linear and discrete programming problems. (1995) . Technical report TR/01/95, Brunel, The University of West London, London Google Scholar
• Hirst J. P. H. Features required in branch-and-bound algorithms for (0-1) mixed integer linear programming. (1969) . Unpublished manuscript Google Scholar
• Healy W. C. Multiple choice programming. Oper. Res. (1964) 12 122 138 Link, Google Scholar
• Jünger M. , Reinelt G. , Thienel S. Provably good solutions for the traveling salesman problem. Zeitschrift für Oper. Res. (1994) 40 183 217 Google Scholar
• Lai T. , Sahni S. Anomalies in parallel branch-and-bound algorithms. Proc. 1983 Internat. Conf. parallel processing (1983) Google Scholar
• Lai T. H. , Sprague A. A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions. Inform. Processing Lett. (1986) 23 119 122 Crossref, Google Scholar
• Land A. , Powell S. , Hammer P. L. , Johnson E. L. , Korte B. H. Computer codes for problems of integer programming. Discrete Optimization II (1979) (North Holland Publishing CO., Amsterdam) Crossref, Google Scholar
• Land A. H. , Doig A. G. An automatic method for solving discrete programming problems. Econometrica (1960) 28 497 520 Crossref, Google Scholar
• Linderoth J. T. , Savelsbergh M. W. P. A computational study of search strategies in mixed integer programming. (1997) . Technical report TLI-97-12, Georgia Institute of Technology Google Scholar
• Little J. D. C. , Murty K. G. , Sweeney D. W. , Karel C. An algorithm for the traveling salesman problem. Oper. Res. (1963) 21 972 989 Link, Google Scholar
• Mitra G. Investigation of some branch-and-bound strategies for the solution of mixed integer linear programs. Math. Programming (1973) 4 155 170 Crossref, Google Scholar
• Nemhauser G. L. , Savelsbergh M. W. P. , Sigismondi G. C. MINTO, a mixed INTeger optimizer. Oper. Res. Lett. (1994) 15 47 58 Crossref, Google Scholar
• Nygreen B. Branch-and-bound with estimation based on pseudo shadow prices. Math. Programming (1991) 52 59 69 Crossref, Google Scholar
• Padberg M. , Van Roy T. J. , Wolsey L. Valid linear inequalities for fixed charge problems. Oper. Res. (1985) 33 842 861 Link, Google Scholar
• Padberg M. W. , Rinaldi G. A branch-and-cut algorithm for the solution of large scale traveling salesman problems. SIAM Rev. (1991) 33 60 100 Crossref, Google Scholar
• Van Roy T. J. , Wolsey L. A. Solving mixed integer 0-1 programs by automatic reformulation. Oper. Res. (1987) 35 45 57 Link, Google Scholar
• Savelsbergh M. W. P. Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. (1994) 6 445 454 Link, Google Scholar
• Tomlin J. A. , Abadie J. Branch-and-bound methods for integer and non-convex programming. Integer and Non-Linear Programming (1970) (North Holland, Amsterdam) Google Scholar
• Tomlin J. A. An improved branch-and-bound method for integer programming. Oper. Res. (1971) 19 1070 1075 Link, Google Scholar
• Troya J. M. , Ortega M. Study of parallel branch-and-bound algorithms with best-bound-first search. Parallel Comput. (1989) 11 121 126 Crossref, Google Scholar