This discrete analogue of linear programming (LP) is a fundamental NP-hard problem with numerous important applications. However, solving P d remains in general a formidable computational challenge, sometimes even for some small size problems. For standard references on the theory and practice of integer programming the interested reader is referred to, e.g., Nemhauser and Wolsey [113], Schrijver [121], Wolsey [136], and Bertsimas and Weismantel [21].
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
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag New York
About this chapter
Cite this chapter
Lasserre, JB. (2009). Introduction. In: Linear and Integer Programming vs Linear Integration and Counting. Springer Series in Operations Research and Financial Engineering. Springer, New York, NY. https://doi.org/10.1007/978-0-387-09414-4_1
Download citation
DOI: https://doi.org/10.1007/978-0-387-09414-4_1
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-09413-7
Online ISBN: 978-0-387-09414-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)