Early Estimates of the Size of Branch-and-Bound Trees

References

• Anstreicher K., Brixius N., Goux J.-P., Linderoth J. Solving large quadratic assignment problems on computational grids. Math. Programming Ser. B (2002) 91:563–588Crossref, Google Scholar
• Argonne National Laboratory, Mathematics and Computer Science Division (2004) . ftp://ftp.mcs.anl.gov/neos/mip-bench/Google Scholar
• Beasley J. E. An algorithm for solving large capacitated warehouse location problems. Eur. J. Oper. Res. (1988) 33:314–325Crossref, Google Scholar
• Beasley J. E. A lagrangian heuristic for set-covering problems. Naval Res. Logist. (1990a) 37:151–164Crossref, Google Scholar
• Beasley J. E. OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. (1990b) 41:1069–1072Crossref, Google Scholar
• Bixby R. E., Ceria S., McZeal C. M., Savelsbergh M. W. P. An updated mixed integer programming library: MIPLIB 3.0. Optima (1998) 58:12–15Google Scholar
• Brüngger A., Marzetta A., Clausen J., Perregaard M. Solving large-scale QAP problems in parallel with the search library ZRAM. J. Parallel Distributed Comput. (1998) 50:157–169Crossref, Google Scholar
• Chen P. G. Heuristic sampling: A method for predicting the performance of tree search programs. SIAM J. Comput. (1992) 21:295–315Crossref, Google Scholar
• Chu P. C., Beasley J. E. A genetic algorithm for the multidimensional knapsack problem. J. Heuristics (1998) 4:63–86Crossref, Google Scholar
• Falkenauer E. A hybrid grouping genetic algorithm for bin packing. J. Heuristics (1996) 2:5–30Crossref, Google Scholar
• Knuth D. E. Estimating the efficiency of backtracking programs. Math. Comput. (1975) 29:121–136Crossref, Google Scholar
• Linderoth J., Savelsbergh M. W. P. A computational study of search strategies for mixed integer programming. (1997) . Report LEC-97-12, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
• Lobjois L., Lemaitre M. Branch-and-bound algorithm selection by performance prediction. (1998) . American Association for Artificial Intelligence, Menlo Park, CAGoogle Scholar
• Mittelmann H. D. MILPlib (Testcases for MILP). (2003) . available at, ftp://plato.asu.edu/pub/milp/. Retrieval date: February 26, 2003Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) Crossref, Google Scholar
• Purdom P. W. Tree size by partial backtracking. SIAM J. Comput. (1978) 7:481–491Crossref, Google Scholar
• Wolsey L. A.Integer Programming (1998) (John Wiley and Sons, New York) Google Scholar