Skip to main content
SpringerLink
Log in

Comments on: On learning and branching: a survey

  • Discussion
  • Published:
TOP Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Achterberg T (2009) Constraint integer programming. PhD thesis, Technische Universität Berlin

  • Achterberg T, Wunderling R (2013) Mixed integer programming: analyzing 12 years of progress. In: Jünger M, Reinelt G (eds) Facets of combinatorial optimization. Springer, Berlin

    Google Scholar 

  • Basso S, Ceselli A, Tettamanzi A (2017) Random sampling and machine learning to understand good decompositions. Tech. Rep. 2434/487931, University of Milan. http://www.optimization-online.org/DB_HTML/2017/03/5924.html. Accessed 6 June 2017

  • Bodic PL, Nemhauser GL (2015) An abstract model for branching and its application to mixed integer programming. arXiv preprint. arXiv:1511.01818

  • Dai H, Khalil EB, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. arXiv preprint. arXiv:1704.01665

  • Gupta R, Roughgarden T (2016) A PAC approach to application-specific algorithm selection. In: Proceedings of the 2016 ACM conference on innovations in theoretical computer science. ACM, New York, pp 123–134

  • He H, Daume III H, Eisner JM (2014) Learning to search in branch-and-bound algorithms. In: Advances in neural information processing systems, pp 3293–3301

  • Karzan FK, Nemhauser GL, Savelsbergh MW (2009) Information-based branching schemes for binary linear mixed integer problems. Math Program Comput 1(4):249–293

    Article  Google Scholar 

  • Khalil EB (2016) Machine learning for integer programming. In: Proceedings of the doctoral consortium at the international joint conference on artificial intelligence, pp 4004–4005

  • Khalil EB, Dilkina B, Nemhauser GL, Ahmed S, Shao Y (2017) Learning to run heuristics in tree search. In: Proceedings of the international joint conference on artificial intelligence. AAAI Press, Melbourne, Australia

  • Kruber M, Lübbecke ME, Parmentier A (2017) Learning when to use a decomposition. In: Conference on integration of artificial intelligence and operations research techniques in constraint programming. Lecture Notes in Computer Science series. Springer, Padova

  • Pryor J, Chinneck JW (2011) Faster integer-feasibility in mixed-integer linear programs by branching to force change. Comput Oper Res 38(8):1143–1152

    Article  Google Scholar 

  • Sabharwal A, Samulowitz H, Reddy C (2012) Guiding combinatorial optimization with UCT. In: International conference on integration of artificial intelligence (AI) and operations research (OR) techniques in constraint programming. Springer, Berlin, pp 356–361

  • Wojtaszek DT, Chinneck JW (2010) Faster MIP solutions via new node selection rules. Comput Oper Res 37(9):1544–1556

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, USA

    Bistra Dilkina & Elias B. Khalil

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA

    George L. Nemhauser

Authors
  1. Bistra Dilkina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elias B. Khalil
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. George L. Nemhauser
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George L. Nemhauser.

Additional information

This comment refers to the invited paper available at doi:10.1007/s11750-017-0451-6.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dilkina, B., Khalil, E.B. & Nemhauser, G.L. Comments on: On learning and branching: a survey. TOP 25, 242–246 (2017). https://doi.org/10.1007/s11750-017-0454-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-017-0454-3

Search

Navigation