Abstract
At the beginning of this chapter, we show that the assumption of the integrality of data (Section 1.1) has a deep theoretical meaning. Next, in Sections 3.2–3.4 we consider problems in which requirements of integrality are redundant. By solving these problems by the simplex method we find an integer optimal solution. If integrality requirements are not redundant, by adding appropriate cuts we may transform solving of a given integer programming problem into solving a sequence of linear programming problems. The remainder of this chapter is devoted to the description of cutting-plane methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Walukiewicz, S. (1991). Unimodularity and Network Flows. Cutting-Plane Methods. In: Integer Programming. Mathematics and Its Applications, vol 46. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-7945-2_3
Download citation
DOI: https://doi.org/10.1007/978-94-015-7945-2_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4068-8
Online ISBN: 978-94-015-7945-2
eBook Packages: Springer Book Archive