Improving Strong Branching by Propagation

Abstract

Strong branching is an important component of most variable selection rules in branchand-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 branchand-bound tree small. In this paper, we describe how these dual bound predictions can be improved by… (More)
DOI: 10.1007/978-3-642-38171-3_25

Topics

4 Figures and Tables

Slides referencing similar topics