On a generalization of the Chvátal-Gomory closure
From MaRDI portal
Publication:2118122
DOI10.1007/s10107-021-01697-0zbMath1489.90063OpenAlexW3190594047MaRDI QIDQ2118122
Sanjeeb Dash, Dabeen Lee, Oktay Günlük
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-021-01697-0
integer programmingcutting planespolyhedralityChvátal-Gomory cutsChvátal-Gomory closure\(S\)-free sets
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- On the polyhedrality of cross and quadrilateral closures
- On the exact separation of mixed integer knapsack cuts
- Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
- MIR closures of polyhedral sets
- Optimizing over the first Chvátal closure
- Chvátal closures for mixed integer programming problems
- Cook, Kannan and Schrijver's example revisited
- Matrices with the Edmonds-Johnson property
- Disjunctive programming: Properties of the convex hull of feasible points
- Split closure and intersection cuts
- Aggregation-based cutting-planes for packing and covering integer programs
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
- On finitely generated closures in the theory of cutting planes
- Lifting Gomory cuts with bounded variables
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables
- The triangle closure is a polyhedron
- On the Chvátal-Gomory closure of a compact convex set
- Intersection cuts for factorable MINLP
- Cutting planes from wide split disjunctions
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Cuts for mixed 0-1 conic programming
- Integer packing sets form a well-quasi-ordering
- The Chvátal-Gomory Closure of a Strictly Convex Body
- Constrained Infinite Group Relaxations of MIPs
- Minimal Valid Inequalities for Integer Constraints
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Integer Programming
- Outline of an algorithm for integer solutions to linear programs
- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
- Solving Large-Scale Zero-One Linear Programming Problems
- On Cutting Planes
- On the existence of optimal solutions to integer and mixed-integer programming problems
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width
- On a Generalization of the Chvátal-Gomory Closure
- Maximal Quadratic-Free Sets
- The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope
- Cut-Generating Functions and S-Free Sets
- Paths, Trees, and Flowers
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
