Backdoor Branching

References

• Achterberg T (2007) Constraint integer programming. Doctoral dissertation, Technischen Universität, Berlin.Google Scholar
• Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Oper. Res. Lett. 33:42–54.Crossref, Google Scholar
• Achterberg T, Koch T, Martin A (2006) MIPLIB 2003. Oper. Res. Lett. 34:361–372.Crossref, Google Scholar
• Applegate D, Bixby RE, Chvatal V, Cook W (1995) Finding cuts in the TSP. Technical Report 95-09, DIMACS, Piscataway, NJ.Google Scholar
• Balas E, Ceria S, Cornuéjols G, Natraj N (1996) Gomory cuts revisited. Oper. Res. Lett. 19:1–9.Crossref, Google Scholar
• Bénichou M, Gauthier JM, Girodet P, Hentges G, Ribière G, Vincent O (1971) Experiments in mixed integer linear programming. Math. Programming 1:76–94.Crossref, Google Scholar
• Chvátal V (1997) Resolution search. Discrete Appl. Math. 73:81–99.Crossref, Google Scholar
• COR@L (2005) Computational optimization research at Lehigh. Available at http://coral.ie.lehigh.edu/data-sets/mixed-integer-instances/.Google Scholar
• Dilkina B, Gomes CP, Malitsky Y, Sabharwal A, Sellmann M (2009) Backdoors to combinatorial optimization: Feasibility and optimality. van Hoeve WJ, Hooker JN, eds. CPAIOR2009, Proc. 6th Internat. Conf. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optim. Problems (Springer-Verlag, Berlin, Heidelberg), 56–70.Crossref, Google Scholar
• Fischetti M, Monaci M (2011) Backdoor branching. Günlük O, Woeginger GJ, eds. IPCO 2011, Proc. 15th Conf. Integer Programming and Combinatorial Optim. (Springer-Verlag, Berlin, Heidelberg), 183–191.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. CPAIOR2010, Proc. 7th Internat. Conf. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optim. Problems (Springer-Verlag, Berlin, Heidelberg), 186–202.Crossref, Google Scholar
• Karzan FK, Nemhauser GL, Savelsbergh MWP (2009) Information-based branching schemes for binary linear mixed integer problems. Math. Programming Comput. 1:249–293.Crossref, Google Scholar
• Koch T, Achterberg T, Andersen E, Bastert O, Berthold T, Bixby RE, Danna E, et al. (2011) MIPLIB 2010 mixed integer programming library version 5. Math. Programming Comput. 3:103–163.Crossref, Google Scholar
• Linderoth JT, Savelsbergh MWP (1999) A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11:173–187.Link, Google Scholar
• Patel J, Chinneck JW (2007) Active-constraint variable ordering for faster feasibility of mixed integer linear programs. Math. Programming 110:445–474.Crossref, Google Scholar
• Pryor J, Chinneck JW (2011) Faster integer-feasibility in mixed-integer linear programs by branching to force change. Comput. Oper. Res. 38:1143–1152.Crossref, Google Scholar
• Williams R, Gomes CP, Selman B (2003) Backdoors to typical case complexity. Gottlob G, Walsh T, eds. IJCAI-03, Proc. Eighteenth Internat. Joint Conf. Artificial Intelligence (Morgan Kaufmann, San Francisco), 1173–1178.Google Scholar
• Wojtaszek DT, Chinneck JW (2010) Faster MIP solutions via new node selection rules. Comput. Oper. Res. 37:1544–1556.Crossref, Google Scholar