In the second part of the book, we consider the linear counting problem I d and establish a comparison with its (max, +)-algebra analogue P d, as well as with the LP problem P.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). The Linear Counting Problem Id . 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_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-09414-4_4
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)