On the separation of split cuts and related inequalities

DOI10.1007/S10107-002-0320-3zbMath1030.90095DBLPjournals/mp/CapraraL03OpenAlexW2010730730WikidataQ57702345 ScholiaQ57702345MaRDI QIDQ1411614

Adam N. Letchford, Alberto Caprara

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-0320-3

Mathematics Subject Classification ID

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

Related Items (26)

Column basis reduction and decomposable knapsack problems ⋮ Disjunctive Cuts for Nonconvex MINLP ⋮ MIPping closures: An instant survey ⋮ MIR closures of polyhedral sets ⋮ A constructive characterization of the split closure of a mixed integer linear program ⋮ On optimizing over lift-and-project closures ⋮ Optimizing over the first Chvátal closure ⋮ DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips ⋮ Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set ⋮ On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube ⋮ Bilevel programming and the separation problem ⋮ A heuristic to generate rank-1 GMI cuts ⋮ On the membership problem for the \({0, 1/2}\)-closure ⋮ Split cuts from sparse disjunctions ⋮ Split cuts for robust mixed-integer optimization ⋮ On the facet defining inequalities of the mixed-integer bilinear covering set ⋮ The mixing-MIR set with divisible capacities ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ The stable set polytope of quasi-line graphs ⋮ Cook, Kannan and Schrijver's example revisited ⋮ Lattice Reformulation Cuts ⋮ Optimizing over the split closure ⋮ Projected Chvátal-Gomory cuts for mixed integer linear programs ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Valid inequalities for mixed integer linear programs ⋮ Approximate fixed-rank closures of covering problems

This page was built for publication: On the separation of split cuts and related inequalities