Branching on split disjunctions

MaRDI QIDQ2928710zbMATH OpenFDO

Authors Giacomo Nannicini, Gérard Cornuéjols, Miroslav Karamanov, Leo Liberti

Publication date 10 November 2014

zbMATH Keywords

integer programmingsplit disjunctionsBranch-and-bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)

Recommendations

• Branching on general disjunctions
• Improved strategies for branching on general disjunctions
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
• Split cuts from sparse disjunctions
• Cutting planes from wide split disjunctions

Cited in

(7)

• Cutting planes from wide split disjunctions
• Improved branching disjunctions for branch-and-bound: an analytic center approach
• Branching on general disjunctions
• Improved strategies for branching on general disjunctions
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
• Split cuts from sparse disjunctions
• On the complexity of selecting disjunctions in integer programming

This page was built for publication: Branching on split disjunctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928710)