On the Chvátal-Gomory closure of a compact convex set
From MaRDI portal
Publication:2248755
DOI10.1007/S10107-013-0649-9zbMATH Open1298.90056OpenAlexW2569749172MaRDI QIDQ2248755FDOQ2248755
Authors: Daniel Dadush, Santanu S. Dey, J. P. Vielma
Publication date: 27 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0649-9
Recommendations
- On the Chvátal-Gomory closure of a compact convex set
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
- The Chvátal-Gomory closure of a strictly convex body
- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
- The Gomory-Chvátal closure of a nonrational polytope is a rational polytope
Cites Work
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- On the symmetric travelling salesman problem I: Inequalities
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- Outline of an algorithm for integer solutions to linear programs
- Optimizing over the first Chvátal closure
- Edmonds polytopes and a hierarchy of combinatorial problems
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Cuts for mixed 0-1 conic programming
- On Cutting Planes
- Title not available (Why is that?)
- The Chvátal-Gomory closure of a strictly convex body
- On the Chvátal-Gomory closure of a compact convex set
- The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope
- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
Cited In (22)
- On a generalization of the Chvátal-Gomory closure
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Title not available (Why is that?)
- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank
- Split Cuts in the Plane
- The Chvátal-Gomory closure of a strictly convex body
- Title not available (Why is that?)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
- On the Chvátal-Gomory closure of a compact convex set
- Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank
- On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
- On the polyhedrality of cross and quadrilateral closures
- On the convergence of the affine hull of the Chvàtal-Gomory closures
- On the rational polytopes with Chvátal rank 1
- On a Generalization of the Chvátal-Gomory Closure
- A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables
- The split closure of a strictly convex body
- Lattice closures of polyhedra
- Mixed-Integer Convex Representability
This page was built for publication: On the Chvátal-Gomory closure of a compact convex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248755)