On convergence in mixed integer programming

DOI10.1007/s10107-011-0476-9zbMath1254.90123WikidataQ57568127 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

convergence; mixed integer programming; disjunctive programming; cutting planes; split cuts; lattice-free polyhedra

Mathematics Subject Classification ID

90C10: Integer programming

90C11: Mixed integer programming

40A05: Convergence and divergence of series and sequences

Related Items

Relaxations of mixed integer sets from lattice-free polyhedra, On finitely generated closures in the theory of cutting planes

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