On the separation of disjunctive cuts

DOI10.1007/s10107-009-0300-yzbMath1218.90125OpenAlexW2042403815MaRDI QIDQ543404

Matteo Fischetti, Andrea Lodi, Andrea Tramontani

Publication date: 17 June 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-0300-y

zbMATH Keywords

normalization conditionover-weak cuts

Mathematics Subject Classification ID

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

Related Items

Reformulating the disjunctive cut generating linear program, Implementing Automatic Benders Decomposition in a Modern MIP Solver, On optimizing over lift-and-project closures, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Computational Experiments with Cross and Crooked Cross Cuts, Disjunctive cuts in mixed-integer conic optimization, Bilevel programming and the separation problem, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Split cuts from sparse disjunctions, Generalized intersection cuts and a new cut generating paradigm, Lift-and-project cuts for convex mixed integer nonlinear programs, Enhanced mixed integer programming techniques and routing problems, Strong-branching inequalities for convex mixed integer nonlinear programs, Using symmetry to optimize over the Sherali-Adams relaxation, Lift-and-Project Cuts for Mixed Integer Convex Programs, Lattice Reformulation Cuts, ``Facet separation with one linear program, An L-shaped method with strengthened lift-and-project cuts

Uses Software

• MIPLIB
• OR-Library
• PORTA

Cites Work

• Lift-and-project for mixed 0-1 programming: recent progress
• Optimizing over the first Chvátal closure
• Chvátal closures for mixed integer programming problems
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
• Strengthening cuts for mixed integer programs
• Disjunctive programming: Properties of the convex hull of feasible points
• A modified lift-and-project procedure
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Optimizing over the split closure
• Edmonds polytopes and a hierarchy of combinatorial problems
• Disjunctive Programming
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• On the MIR Closure of Polyhedra