Cutting Planes and the Elementary Closure in Fixed Dimension

DOI10.1287/MOOR.26.2.304.10555MaRDI QIDQ5704040zbMATH OpenOpenAlexFDO

Authors Alexander Bockmayr, Friedrich Eisenbrand

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b5c62e264fd244896f9ee50b4aba16099f7ef6b3

zbMATH Keywords

complexitycutting planeelementary closureInteger programming

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On the Chvátal rank of polytopes in the 0/1 cube
• Corner polyhedra and their connection with cutting planes
• Elementary closures for integer programs.
• Chvátal closures for mixed integer programming problems
• scientific article; zbMATH DE number 4202024

Cited in

(10)

• On the membership problem for the elementary closure of a polyhedron
• Cutting planes from a mixed integer Farkas lemma.
• Totally tight Chvatal-Gomory cuts
• A connection between cutting plane theory and the geometry of numbers
• On finitely generated closures in the theory of cutting planes
• Generalized Chvátal-Gomory closures for integer programs with bounds on variables
• scientific article; zbMATH DE number 4202024 (Why is no real title available?)
• Split cuts in the plane
• Computation of invariants of finite abelian groups
• Elementary closures for integer programs.

This page was built for publication: Cutting Planes and the Elementary Closure in Fixed Dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704040)