An upper bound on the number of cuts needed in Gomory's method of integer forms

DOI10.1016/0167-6377(82)90014-1zbMath0492.90058OpenAlexW2055163563MaRDI QIDQ1168218

Francis J. Nourie, Enrique R. Venta

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0167-6377(82)90014-1

zbMATH Keywords

upper boundslower boundscutting plane methodGomory's method of integer formsmaximal number of cutsworst case behaviour

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Related Items (3)

On the enumerative nature of Gomory's dual cutting plane method ⋮ Estimation of the number of iterations in integer programming algorithms using the regular partitions method ⋮ Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs

Cites Work

• Unnamed Item

This page was built for publication: An upper bound on the number of cuts needed in Gomory's method of integer forms