Algorithms to separate \0,12\-Chvátal-Gomory cuts
DOI10.1007/S00453-008-9218-7zbMATH Open1189.90132OpenAlexW2109933087MaRDI QIDQ834596FDOQ834596
Authors: Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka 
Publication date: 27 August 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9218-7
Recommendations
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Outline of an algorithm for integer solutions to linear programs
- On the facial structure of set packing polyhedra
- Title not available (Why is that?)
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Optimizing over the first Chvátal closure
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Title not available (Why is that?)
- Edmonds polytopes and a hierarchy of combinatorial problems
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- On Cutting Planes
- On the separation of maximally violated mod-\(k\) cuts
- Stable multi-sets
- 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
- On cycles and the stable multi-set polytope
- Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets
Cited In (11)
- Generalized coefficient strengthening cuts for mixed integer programming
- Lifting for the integer knapsack cover polyhedron
- On the exact separation of cover inequalities of maximum-depth
- Chvátal-Gomory cuts for the Steiner tree problem
- Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts
Uses Software
This page was built for publication: Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834596)
