However in general, finding the integer hull of a convex polyhedron is a difficult problem. As mentioned in Wolsey [134, p. 15], and to the best of our knowledge, no explicit (or “simple”) characterization (or description) has been provided so far. For instance, its characterization via superadditive functions (e.g., as inWolsey [134]) is mainly of theoretical nature.
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 Integer Hull of a Convex Rational Polytope. 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_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-09414-4_9
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)