TY - GEN A1 - Achterberg, Tobias A1 - Berthold, Timo T1 - Hybrid Branching N2 - 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 (\emph{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. KW - Mixed integer programming KW - Branch-and-Bound KW - Variable selection KW - Pseudocost-Branching KW - Reliability-Branching KW - VSIDS KW - Inference branching KW - Constraint programming Y1 - 2009 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/604 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-6043 ER -