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

DOI10.1007/S10107-020-01539-5zbMATH Open1478.90059OpenAlexW3041176430MaRDI QIDQ2235152FDOQ2235152

Authors: 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

Recommendations

• Chvátal closures for mixed integer programming problems
• Chvatal--Gomory--tier cuts for general integer programs
• Approximability of Integer Programming with Generalised Constraints
• On integer programming with bounded determinants
• Generalized nonlinear Lagrangian formulation for bounded integer programming
• Gomory integer programs
• Elementary closures for integer programs.
• On the closure of the feasible set in generalized semi-infinite programming
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Generalized goal programming and variational inequalities

zbMATH Keywords

integer programmingcutting planespolyhedralityS-free setsChvátal-Gomory closureChvátal-Gomory cuts

Mathematics Subject Classification ID

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

Cites Work

• Outline of an algorithm for integer solutions to linear programs
• Solving Large-Scale Zero-One Linear Programming Problems
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Edmonds polytopes and a hierarchy of combinatorial problems
• Chvátal closures for mixed integer programming problems
• On the membership problem for the elementary closure of a polyhedron
• On the Chvátal-Gomory closure of a compact convex set
• On Cutting Planes
• The Gomory-Chvátal closure of a nonrational polytope is a rational polytope
• Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
• On the knapsack closure of 0-1 integer linear programs
• On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
• Cutting Planes and the Elementary Closure in Fixed Dimension
• ILP and CP formulations for the lazy bureaucrat problem
• Lattice closures of polyhedra
• Integer packing sets form a well-quasi-ordering
• Cutting planes from wide split disjunctions

Cited In (4)

• On a generalization of the Chvátal-Gomory closure
• On a generalization of the Chvátal-Gomory closure
• The Chvátal closure of generalized stable sets in bidirected graphs
• Chvátal closures for mixed integer programming problems

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

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