Algorithms to separate \0,12\-Chvátal-Gomory cuts

DOI10.1007/S00453-008-9218-7MaRDI QIDQ834596zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

integer programmingseparation algorithms\(\{0,\frac {1}{2}\}\)-Chvátal-Gomory cuts

Mathematics Subject Classification ID

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)

Recommendations

• Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• On the membership problem for the \({0, 1/2}\)-closure
• Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
• scientific article; zbMATH DE number 1342122

Cites work

• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• scientific article; zbMATH DE number 3409134 (Why is no real title available?)
• 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
• Edmonds polytopes and a hierarchy of combinatorial problems
• Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
• Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets
• On Cutting Planes
• On cycles and the stable multi-set polytope
• On the facial structure of set packing polyhedra
• On the separation of maximally violated mod-\(k\) cuts
• Optimizing over the first Chvátal closure
• Outline of an algorithm for integer solutions to linear programs
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Stable multi-sets
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts

Cited in

(12)

• Face dimensions of general-purpose cutting planes for mixed-integer linear programs
• On the exact separation of cover inequalities of maximum-depth
• Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
• Automatic integer programming reformulation using variable neighborhood search
• Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
• Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
• Chvátal-Gomory cuts for the Steiner tree problem
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
• Generalized coefficient strengthening cuts for mixed integer programming
• Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
• Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts
• Lifting for the integer knapsack cover polyhedron

Describes a project that uses

Uses Software

• TSPLIB
• SCIP
• MIPLIB
• CPLEX
• MIPLIB2003

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)