On a Generalization of the Chvátal-Gomory Closure

DOI10.1007/978-3-030-45771-6_10zbMath1503.90074arXiv2007.04880OpenAlexW3015535016MaRDI QIDQ5041739

Dabeen Lee, Oktay Günlük, Sanjeeb Dash

Publication date: 14 October 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.04880

zbMATH Keywords

integer programmingcutting planesChvátal-Gomory cuts

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (2)

Two-halfspace closure ⋮ On a generalization of the Chvátal-Gomory closure

Cites Work

• Unnamed Item
• A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
• Generalized Chvátal-Gomory closures for integer programs with bounds on variables
• On the Chvátal-Gomory closure of a compact convex set
• Cutting planes from wide split disjunctions
• Edmonds polytopes and a hierarchy of combinatorial problems
• Integer packing sets form a well-quasi-ordering
• Outline of an algorithm for integer solutions to linear programs
• Solving Large-Scale Zero-One Linear Programming Problems
• On Cutting Planes
• The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope

This page was built for publication: On a Generalization of the Chvátal-Gomory Closure