A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming

DOI10.1007/s10107-002-0317-yzbMath1030.90068OpenAlexW2052281387MaRDI QIDQ1411611

Egon Balas, Michael Perregaard

Publication date: 29 October 2003

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

Full work available at URL: https://doi.org/10.1007/s10107-002-0317-y

Mathematics Subject Classification ID

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

Related Items

Reformulating the disjunctive cut generating linear program, Disjunctive Cuts for Nonconvex MINLP, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, MIR closures of polyhedral sets, Computing deep facet-defining disjunctive cuts for mixed-integer programming, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, Branch-and-cut for linear programs with overlapping SOS1 constraints, A constructive characterization of the split closure of a mixed integer linear program, On optimizing over lift-and-project closures, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, Benders decomposition for network design covering problems, Disjunctive cuts in mixed-integer conic optimization, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, A heuristic to generate rank-1 GMI cuts, Generalized intersection cuts and a new cut generating paradigm, Lift-and-project cuts for convex mixed integer nonlinear programs, A note on the MIR closure and basic relaxations of polyhedra, On linear programs with linear complementarity constraints, Intersection cuts from multiple rows: a disjunctive programming approach, Reflections on generating (disjunctive) cuts, Characterizing acyclic graphs by labeling edges, Disjunctive programming and relaxations of polyhedra, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints, Lift-and-Project Cuts for Mixed Integer Convex Programs, On the relative strength of different generalizations of split cuts, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Optimizing over the split closure, A relax-and-cut framework for Gomory mixed-integer cuts, On the exact separation of mixed integer knapsack cuts, On the separation of disjunctive cuts, Elementary closures for integer programs., Split closure and intersection cuts, Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts, Valid inequalities for mixed integer linear programs, The strength of multi-row models, When Lift-and-Project Cuts Are Different, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, Modelling either-or relations in integer programming, Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants, ``Facet separation with one linear program, On cutting planes for cardinality-constrained linear programs, The aggregation closure is polyhedral for packing and covering integer programs, Lift-and-project for general two-term disjunctions, Depth-optimized convexity cuts, Projection, lifting and extended formulation integer and combinatorial optimization