Abstract
Gomory's group relaxation for integer programs has been refined by column generation methods and dual ascent algorithms to identify a set of candidate solutions which are feasible in the relaxation but not necessarily so in the original integer program. Attempts at avoiding branch and bound procedures at this point have focussed on providing extra group constraints which eliminate all or most of the candidate solutions so that further ascent can take place. It will be shown that a single constraint usually of order 2 or 3, can eliminate all of the candidate solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.E. Bell, “A simple algorithm for integer programs using group constraints,”Operational Research Quarterly 28 (1977) 453–458.
D.E. Bell and J.F. Shapiro, “A Convergent duality theory for integer programming,”Operations Research 25 (1977) 419–434.
M.L. Fisher, W.D. Northup and J.F. Shapiro “Using duality to solve discrete optimization problems: theory and computational experience,”Mathematical Programming Study 3 (1975) 56–94.
M.L. Fisher and J.F. Shapiro, “Constructive duality in integer programming,”SIAM Journal on Applied Mathematics 27 (1974) 31–52.
G.A. Gorry, W.D. Northup and J.F. Shapiro, “Computational experience with a group theoretic integer programming algorithm,”Mathematical Programming 4 (1973) 171–192.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bell, D.E. Efficient group cuts for integer programs. Mathematical Programming 17, 176–183 (1979). https://doi.org/10.1007/BF01588242
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588242