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

DOI10.1016/J.DISOPT.2004.12.002MaRDI QIDQ1779688zbMATH OpenOpenAlexFDO

Authors 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

CG-tier cuts.Chvatal-Gomory (CG) cutsGomory cutsInteger programming

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Iterated Chvátal-Gomory cuts and the geometry of numbers
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
• Totally tight Chvatal-Gomory cuts
• Aggregation-based cutting-planes for packing and covering integer programs
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts

Cites work

• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• k-cuts: a variation of Gomory mixed integer cuts from the LP tableau
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Combining and strengthening Gomory cuts
• Edmonds polytopes and a hierarchy of combinatorial problems
• Foundation-penalty cuts for mixed-integer programs.
• Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
• Gomory cuts revisited
• scientific article; zbMATH DE number 429689 (Why is no real title available?)
• scientific article; zbMATH DE number 3156817 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• Mixing mixed-integer inequalities
• On the membership problem for the elementary closure of a polyhedron
• On the separation of maximally violated mod-\(k\) cuts
• Some polyhedra related to combinatorial problems
• Totally tight Chvatal-Gomory cuts

Cited in

(6)

• Totally tight Chvatal-Gomory cuts
• Aggregation-based cutting-planes for packing and covering integer programs
• Generalized Chvátal-Gomory closures for integer programs with bounds on variables
• On the hierarchy of γ-valid cuts in global optimization
• Can cut-generating functions be good and efficient?
• Chvátal closures for mixed integer programming problems

This page was built for publication: Chvatal--Gomory--tier cuts for general integer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779688)