Branching on general disjunctions


This paper considers a modification of the branch-and-cut algorithm for Mixed Integer Linear Programming where branching is performed on general disjunctions rather than on variables. We select promising branching disjunctions based on a heuristic measure of disjunction quality. This measure exploits the relation between branching disjunctions and… (More)
DOI: 10.1007/s10107-009-0332-3


15 Figures and Tables