Improved strategies for branching on general disjunctions

DOI10.1007/S10107-009-0333-2zbMATH Open1229.90104OpenAlexW2070788858MaRDI QIDQ652284FDOQ652284

Authors: Leo Liberti, Gérard Cornuéjols, Giacomo Nannicini 

Publication date: 14 December 2011

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-009-0333-2

Recommendations

• Branching on general disjunctions
• Branching on split disjunctions
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
• Branching rules revisited
• Achieving MILP feasibility quickly using general disjunctions

zbMATH Keywords

integer programmingbranch and boundsplit disjunctions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Cites Work

• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Title not available (Why is that?)
• Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
• Disjunctive Programming
• Title not available (Why is that?)
• Optimizing over the split closure
• Branching on general disjunctions
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
• Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances

Cited In (20)

• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
• Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• An abstract model for branch and cut
• Branching on nonchimerical fractionalities
• Compressing branch-and-bound trees
• Branching rules revisited
• Intermediate integer programming representations using value disjunctions
• Improved branching disjunctions for branch-and-bound: an analytic center approach
• Achieving MILP feasibility quickly using general disjunctions
• A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management
• Branching on general disjunctions
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
• An abstract model for branch-and-cut
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• Lower bounds on the size of general branch-and-bound trees
• On the complexity of selecting disjunctions in integer programming
• Information-based branching schemes for binary linear mixed integer problems
• Practical strategies for generating rank-1 split cuts in mixed-integer linear programming

Uses Software

• CPLEX

This page was built for publication: Improved strategies for branching on general disjunctions

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