Algorithms to Separate {\{0,\frac{1}{2}\}} -Chvátal-Gomory Cuts

DOI10.1007/978-3-540-75520-3_61MaRDI QIDQ3527258zbMATH OpenOpenAlexFDO

Authors Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka

Publication date 25 September 2008

Published in Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75520-3_61

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

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

Cited in

(6)

• Computational experience with general cutting planes for the set covering problem
• Automatic integer programming reformulation using variable neighborhood search
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
• scientific article; zbMATH DE number 1500572 (Why is no real title available?)
• Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts

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 Q3527258)