Two algorithms to get strong Gomory cuts

DOI10.1080/02331938908843420MaRDI QIDQ4731009zbMATH OpenOpenAlexFDO

Authors B. Vizvári

Publication date 1989

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938908843420

zbMATH Keywords

Frobenius probleminteger hullstrong Gomory cut

Mathematics Subject Classification ID

The Frobenius problem (11D07) Integer programming (90C10) Dynamic programming (90C39)

Recommendations

• Combining and strengthening Gomory cuts
• An application of Gomory cuts in number theory
• scientific article; zbMATH DE number 4070630
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
• One modification of Gomory's algorithm

Cites work

• A Minimal-Path Algorithm for the "Money Changing Problem"
• Edmonds polytopes and a hierarchy of combinatorial problems
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)

Cited in

(5)

• Primal-dual simplex method for shooting
• scientific article; zbMATH DE number 4070630 (Why is no real title available?)
• Combining and strengthening Gomory cuts
• Strengthening Gomory Mixed-Integer Cuts
• Computing with multi-row gomory cuts

This page was built for publication: Two algorithms to get strong Gomory cuts

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