Totally tight Chvatal-Gomory cuts

DOI10.1016/S0167-6377(02)00111-6zbMath1027.90061WikidataQ57702369 ScholiaQ57702369MaRDI QIDQ1612006

Adam N. Letchford

Publication date: 28 August 2002

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

integer programmingpolynomial-time algorithmcutting planesseparationHermite normal formChvátal-Gomory cut

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Metric inequalities and the network loading problem ⋮ Chvatal--Gomory--tier cuts for general integer programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of the Hermite normal form in integer programming
• On the membership problem for the elementary closure of a polyhedron
• Geometric algorithms and combinatorial optimization
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• On the separation of maximally violated mod-\(k\) cuts
• Edmonds polytopes and a hierarchy of combinatorial problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
• Combining and strengthening Gomory cuts
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Systems of distinct representatives and linear algebra
• Cutting Planes and the Elementary Closure in Fixed Dimension