Abstract
Many real-world problems could be modeled as linear programs except that some or all of the variables are constrained to be integers. Such problems are called integer programming problems. One might think that these problems wouldn’t be much harder than linear programming problems. For example, we saw in Chapter 14 that for network flow problems with integer data, the simplex method automatically produces integer solutions. But that was just luck. In general, one can’t expect to get integer solutions; in fact, as we shall see in this chapter, integer programming problems turn out to be generally much harder to crack than linear ones.
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
Bibliography
Cook, W. (2012). In pursuit of the traveling salesman. Princeton: Princeton University Press.
Garfinkel, R., and Nemhauser, G. (1972). Integer programming. New York: Wiley.
Nemhauser, G., and Wolsey, L. (1988). Integer and combinatorial optimization. New York: Wiley.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Vanderbei, R.J. (2014). Integer Programming. In: Linear Programming. International Series in Operations Research & Management Science, vol 196. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-7630-6_23
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7630-6_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-7629-0
Online ISBN: 978-1-4614-7630-6
eBook Packages: Business and EconomicsBusiness and Management (R0)