Two algorithms to get strong Gomory cuts

DOI10.1080/02331938908843420zbMath0681.90059OpenAlexW1985864558MaRDI QIDQ4731009

Béla 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

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

Cites Work

• Unnamed Item
• Edmonds polytopes and a hierarchy of combinatorial problems
• A Minimal-Path Algorithm for the "Money Changing Problem"

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