Skip to main content
SpringerLink
Log in

Hybrid Branching

  • Conference paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5547))

Abstract

State-of-the-art solvers for Constraint Satisfaction Problems (CSP), Mixed Integer Programs (MIP), and satisfiability problems (SAT) are usually based on a branch-and-bound algorithm. The question how to split a problem into subproblems (branching) is in the core of any branch-and-bound algorithm. Branching on individual variables is very common in CSP, MIP, and SAT. The rules, however, which variable to choose for branching, differ significantly. In this paper, we present hybrid branching, which combines selection rules from all three fields.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation (1) (2008)

    Google Scholar 

  2. Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters 33, 42–54 (2005)

    Article  MathSciNet  Google Scholar 

  3. Karzan, F.K., Nemhauser, G., Savelsbergh, M.: Information based branching rules in integer programming. Presentation at INFORMS Annual Meeting (2008)

    Google Scholar 

  4. Li, C.M., Anbulagan: Look-ahead versus look-back for satisfiability problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 342–356. Springer, Heidelberg (1997)

    Google Scholar 

  5. Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. of Comp. 48, 506–521 (1999)

    Article  MathSciNet  Google Scholar 

  6. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. of the DAC (July 2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ILOG, an IBM company, Ober-Eschbacher Str. 109, 61352, Bad Homburg, Germany

    Tobias Achterberg

  2. Zuse Institute Berlin, Takustr. 7, 14195, Berlin, Germany

    Timo Berthold

Authors
  1. Tobias Achterberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Timo Berthold
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, PA 15213, Pittsburgh, USA

    Willem-Jan van Hoeve

  2. Carnegie Mellon University, USA

    John N. Hooker

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Achterberg, T., Berthold, T. (2009). Hybrid Branching. In: van Hoeve, WJ., Hooker, J.N. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2009. Lecture Notes in Computer Science, vol 5547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01929-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01929-6_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01928-9

  • Online ISBN: 978-3-642-01929-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation