On convergence in mixed integer programming

DOI10.1007/s10107-011-0476-9zbMath1254.90123DBLPjournals/mp/PiaW12OpenAlexW2071996748WikidataQ57568127 ScholiaQ57568127MaRDI QIDQ715071

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

zbMATH Keywords

convergencemixed integer programmingdisjunctive programmingcutting planessplit cutslattice-free polyhedra

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Convergence and divergence of series and sequences (40A05)

Related Items (13)

Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results ⋮ Binary extended formulations of polyhedral mixed-integer sets ⋮ Theoretical challenges towards cutting-plane selection ⋮ On the polyhedrality of cross and quadrilateral closures ⋮ On finitely generated closures in the theory of cutting planes ⋮ Reverse split rank ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Generalized flatness constants, spanning lattice polytopes, and the Gromov width ⋮ Disjunctive programming and relaxations of polyhedra ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming ⋮ Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming ⋮ Relaxations of mixed integer sets from lattice-free polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
• Chvátal closures for mixed integer programming problems
• Edmonds polytopes and a hierarchy of combinatorial problems
• An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
• On the Convergence of Sequences of Convex Sets in Finite Dimensions
• On Cutting Planes
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Convex Analysis
• A disjunctive cutting plane procedure for general mixed-integer linear programs

This page was built for publication: On convergence in mixed integer programming