TY - JOUR A1 - Gamrath, Gerald A2 - Gomes, Carla A2 - Sellmann, Meinolf T1 - Improving strong branching by propagation T2 - Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems N2 - Strong branching is an important component of most variable selection rules in branch-and-bound based mixed-integer linear programming solvers. It predicts the dual bounds of potential child nodes by solving auxiliary LPs and thereby helps to keep the branch-and-bound tree small. In this paper, we describe how these dual bound predictions can be improved by including domain propagation into strong branching. Computational experiments on standard MIP instances indicate that this is beneficial in three aspects: It helps to reduce the average number of LP iterations per strong branching call, the number of branch-and-bound nodes, and the overall solving time. Y1 - 2013 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/4326 VL - 7874 SP - 347 EP - 354 PB - Springer Berlin Heidelberg ER -