Chvatal--Gomory--tier cuts for general integer programs

DOI10.1016/j.disopt.2004.12.002zbMath1140.90470OpenAlexW2002826134MaRDI QIDQ1779688

Fred Glover, Hanif D. Sherali

Publication date: 1 June 2005

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2004.12.002

zbMATH Keywords

Integer programmingGomory cutsCG-tier cuts.Chvatal-Gomory (CG) cuts

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the membership problem for the elementary closure of a polyhedron
• Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
• Foundation-penalty cuts for mixed-integer programs.
• Totally tight Chvatal-Gomory cuts
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• On the separation of maximally violated mod-\(k\) cuts
• Some polyhedra related to combinatorial problems
• Edmonds polytopes and a hierarchy of combinatorial problems
• Gomory cuts revisited
• K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Combining and strengthening Gomory cuts
• Mixing mixed-integer inequalities