Generalized Chvátal-Gomory closures for integer programs with bounds on variables

DOI10.1007/s10107-020-01539-5zbMath1478.90059OpenAlexW3041176430MaRDI QIDQ2235152

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

Publication date: 20 October 2021

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-020-01539-5

zbMATH Keywords

integer programmingcutting planespolyhedralityChvátal-Gomory cutsChvátal-Gomory closureS-free sets

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

On a Generalization of the Chvátal-Gomory Closure ⋮ On a generalization of the Chvátal-Gomory closure

Cites Work

• Unnamed Item
• Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
• Chvátal closures for mixed integer programming problems
• On the membership problem for the elementary closure of a polyhedron
• Lattice closures of polyhedra
• 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
• On the existence of optimal solutions to integer and mixed-integer programming problems
• On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width
• The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope
• Cutting Planes and the Elementary Closure in Fixed Dimension
• ILP and CP Formulations for the Lazy Bureaucrat Problem

This page was built for publication: Generalized Chvátal-Gomory closures for integer programs with bounds on variables