Cutting planes from two-term disjunctions

DOI10.1016/j.orl.2013.05.005zbMath1286.90121OpenAlexW1966507156MaRDI QIDQ2450685

Marco Molinaro, Michele Conforti, Giacomo Zambelli, Pierre Bonami, Cornuéjols, Gérard

Publication date: 15 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.05.005

zbMATH Keywords

polyhedronconvex hullcutting planetwo-term disjunction

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial optimization (90C27) Dissections and valuations (Hilbert's third problem, etc.) (52B45)

Related Items

Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Two-term disjunctions on the second-order cone, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints

Cites Work

• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
• A recursive procedure to generate all cuts for 0-1 mixed integer programs