A Machine Learning-Based Approximation of Strong Branching

References

• Achterberg T, Berthold T (2009) Hybrid branching. van Hoeve W-J, Hooker JN, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Springer, Berlin), 309–311.Crossref, Google Scholar
• Achterberg T, Wunderling R (2013) Mixed integer programming: Analyzing 12 years of progress. Jünger M, Reinelt G, eds. Facets of Combinatorial Optimization (Springer, Berlin), 449–481.Crossref, Google Scholar
• Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Oper. Res. Lett. 33(1):42–54.Crossref, Google Scholar
• Achterberg T, Koch T, Martin A (2006) MIPLIB 2003. Oper. Res. Lett. 34(4):361–372.Crossref, Google Scholar
• Applegate D, Bixby RE, Chvátal V, Cook W (1995) Finding cuts in the tsp (a preliminary report). Technical Report 05, DIMACS, Center for Discrete Mathematics & Theoretical Computer Science, Rutgers University, Piscataway, NJ.Google Scholar
• Benichou M, Gauthier JM, Girodet P, Hentges G, Ribiere G, Vincent O (1971) Experiments in mixed-integer linear programming. Math. Programming 1(1):76–94.Crossref, Google Scholar
• Berthold T, Salvagnin D (2013) Cloud branching. Gomes C, Sellmann M, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Springer, Berlin), 28–43.Crossref, Google Scholar
• Bixby RE, Ceria S, McZeal C, Savelsbergh MWP (1996) An updated mixed integer programming Library: MIPLIB 3.0. Technical report, Department of Computational and Applied Mathematics, Rice University, Houston, TX.Google Scholar
• Breiman L (2001) Random forests. Machine Learn. 45(1):5–32.Crossref, Google Scholar
• Di Liberto G, Kadioglu S, Leo K, Malitsky Y (2013) DASH: Dynamic approach for switching heuristics. Comput. Res. Repository. Accessed October 21, 2016, https://arxiv.org/abs/1307.4689.Google Scholar
• Driebeek NJ (1966) An algorithm for the solution of mixed integer programming problems. Management Sci. 12(7):576–587.Link, Google Scholar
• Fischetti M, Monaci M (2012) Branching on nonchimerical fractionalities. Oper. Res. Lett. 40(3):159–164.Crossref, Google Scholar
• Fischetti M, Monaci M (2013) Backdoor branching. INFORMS J. Comput. 25(4):693–700.Link, Google Scholar
• Geurts P, Ernst D, Wehenkel L (2006) Extremely randomized trees. Machine Learn. 63(1):3–42.Crossref, Google Scholar
• Hutter F, Hoos HH, Leyton-Brown K (2010) Automated configuration of mixed integer programming solvers. Lodi A, Milano M, Toth P, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Springer, Berlin), 186–202.Crossref, Google Scholar
• Hutter F, Xu L, Hoos HH, Leyton-Brown K (2014) Algorithm runtime prediction: Methods and evaluation. Artificial Intelligence 206:79–111.Crossref, Google Scholar
• Karzan FK, Nemhauser GL, Savelsbergh MWP (2009) Information-based branching schemes for binary linear mixed integer problems. Math. Programming Comput. 1(4):249–293.Crossref, Google Scholar
• Land AH, Doig AG (1960) An automatic method of solving discrete programming problems. Econometrica 28(3):497–520.Crossref, Google Scholar
• Li CM, Anbulagan (1997) Look-ahead versus look-back for satisfiability problems. Smolka G, ed. Principles and Practice of Constraint Programming-CP97. Lecture Notes in Computer Science, Vol. 1330 (Springer, Berlin), 341–355.Crossref, Google Scholar
• Patel J, Chinneck JW (2007) Active-constraint variable ordering for faster feasibility of mixed integer linear programs. Math. Programming 110(3):445–474.Crossref, Google Scholar
• Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. Evolutionary Comput., IEEE Trans. 1(1):67–82.Crossref, Google Scholar