Abstract
This note shows that convexity cuts defined relative to polyhedral convex sets can utilize negative as well as positive edge extensions under appropriate circumstances, yielding stronger cuts than customarily available. We also show how to partially collapse the polyhedron to further improve these cuts.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas, E.: The Intersection Cut — A New Cutting Plane for Integer Programming, Operations Research19, 19–39, 1970.
Burdet, C.-A.: Enumerative Cuts: I, Operations Research21, No. 1, 61–89, January–February 1973.
Glover, F.: Convexity Cuts and Gut Search, Operations Research,21, No. 1, 123–124, January–February 1973.
-: Convexity Cuts for Multiple Choice Problems, MSRS 71-5, University of Colorado, to appear in Discrete Mathematics, May 1971.
Glover, F., andD. Klingmann: The Generalized Lattice Point Problem, Operations Research21, No. 1, 141–156, 1973.
-: Improved Convexity Cuts for Lattice Point Problems, Research Report CS 133, University of Texas, April 1973.
Glover, F., andD. Sommer: Inequalities for Mixed Integer Programs with Structure, MSRS 73-2, University of Colorado, February 1973.
Tui, H.: Concave Programming Under Linear Constraints, Doklady Akademii Nauk SSSR 1964 (in Russian), Soviet Mathematics 1437–1440 (English translation), 1964.
Young, R. D.: Hypercylindrically Deduced Cuts in Zero-One Integer Programming, Operations Research, Vol.19, 1393–1405, 1971.
Author information
Authors and Affiliations
Additional information
Management Science Report Series, Report No. 73-6.
Rights and permissions
About this article
Cite this article
Glover, F. Polyhedral convexity cuts and negative edge extensions. Zeitschrift für Operations Research 18, 181–186 (1974). https://doi.org/10.1007/BF02026599
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02026599