On convergence in mixed integer programming

DOI10.1007/S10107-011-0476-9MaRDI QIDQ715071zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Alberto Del Pia, Robert Weismantel

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

convergencecutting planesmixed integer programmingdisjunctive programmingsplit cutslattice-free polyhedra

Mathematics Subject Classification ID

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

Recommendations

• Lattice closures of polyhedra
• On the MIR Closure of Polyhedra
• On some generalizations of the split closure
• Chvátal closures for mixed integer programming problems
• MIR closures of polyhedral sets

Cites work

• scientific article; zbMATH DE number 3987367 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• scientific article; zbMATH DE number 3061861 (Why is no real title available?)
• 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
• Chvátal closures for mixed integer programming problems
• Convex Analysis
• Edmonds polytopes and a hierarchy of combinatorial problems
• Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
• On Cutting Planes
• On the Convergence of Sequences of Convex Sets in Finite Dimensions
• On the existence of optimal solutions to integer and mixed-integer programming problems

Cited in

(22)

• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
• Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results
• Generalized halfspaces in the mixed-integer realm
• On the polyhedrality of cross and quadrilateral closures
• Lattice closures of polyhedra
• Disjunctive programming and relaxations of polyhedra
• Chvátal closures for mixed integer programming problems
• Generalized flatness constants, spanning lattice polytopes, and the Gromov width
• Binary extended formulations of polyhedral mixed-integer sets
• The triangle closure is a polyhedron
• Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
• Closedness of integer hulls of simple conic sets
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• Reverse split rank
• On finitely generated closures in the theory of cutting planes
• On the MIR Closure of Polyhedra
• Theoretical challenges towards cutting-plane selection
• Relaxations of mixed integer sets from lattice-free 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
• Integral decomposition of polyhedra and some applications in mixed integer programming
• On the mixed integer signomial programming problems

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)