On convergence in mixed integer programming
DOI10.1007/S10107-011-0476-9zbMATH Open1254.90123DBLPjournals/mp/PiaW12OpenAlexW2071996748WikidataQ57568127 ScholiaQ57568127MaRDI QIDQ715071FDOQ715071
Robert Weismantel, Alberto Del Pia
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/51189
convergencecutting planesmixed integer programmingdisjunctive programmingsplit cutslattice-free polyhedra
Integer programming (90C10) Mixed integer programming (90C11) Convergence and divergence of series and sequences (40A05)
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Chvátal closures for mixed integer programming problems
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
- On Cutting Planes
- Title not available (Why is that?)
- On the Convergence of Sequences of Convex Sets in Finite Dimensions
Cited In (17)
- Integral decomposition of polyhedra and some applications in mixed integer programming
- Disjunctive programming and relaxations of polyhedra
- On the mixed integer signomial programming problems
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- Theoretical challenges towards cutting-plane selection
- Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results
- Binary extended formulations of polyhedral mixed-integer sets
- Reverse split rank
- On the polyhedrality of cross and quadrilateral closures
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Chvátal closures for mixed integer programming problems
- Generalized flatness constants, spanning lattice polytopes, and the Gromov width
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- On finitely generated closures in the theory of cutting planes
This page was built for publication: On convergence in mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715071)
