Abstract
In this chapter we study in detail the class of hypermetric inequalities. In particular, we present several subclasses of hypermetric inequalities that define facets of the cut cone. We also address the separation problem for hypermetric inequalities. Although its exact complexity status is not known, there are several results that indicate that it is very likely to be a hard problem. In particular, the problem of finding the smallest violated hypermetric inequality is NP-hard.
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
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Deza, M.M., Laurent, M. (1997). Hypermetric Inequalities. In: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04295-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-04295-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04294-2
Online ISBN: 978-3-642-04295-9
eBook Packages: Springer Book Archive