On the Rank of Disjunctive Cuts
From MaRDI portal
Publication:2884323
DOI10.1287/moor.1110.0527zbMath1242.90125OpenAlexW2125211008WikidataQ57568132 ScholiaQ57568132MaRDI QIDQ2884323
Publication date: 24 May 2012
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ce6a258349207706ceaa88cf7ec1a8a683d27c62
Related Items
Theoretical challenges towards cutting-plane selection ⋮ Reverse split rank ⋮ Disjunctive programming and relaxations of polyhedra ⋮ Can Cut-Generating Functions Be Good and Efficient? ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Cutting planes from extended LP formulations ⋮ Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming ⋮ Relaxations of mixed integer sets from lattice-free polyhedra