Skip to main content
Log in

On fractional faces of the metric polytope

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

The integrality recognition problem is considered on a sequence M n, k of nested relaxations of a Boolean quadric polytope, including the rooted semimetric M n and metric M n, 3 polytopes. The constraints of the metric polytope cut off all faces of the rooted semimetric polytope that contain only fractional vertices. This makes it possible to solve the integrality recognition problem on M n in polynomial time. To solve the integrality recognition problem on the metric polytope, we consider the possibility of cutting off all fractional faces of M n, 3 by a certain relaxation M n, k . The coordinates of points of the metric polytope are represented in homogeneous form as a three-dimensional block matrix. We show that in studying the question of cutting off the fractional faces of the metric polytope, it is sufficient to consider only constraints in the form of triangle inequalities.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Padberg, M.V., The Boolean quadric polytope: Some characteristics, facets and relatives, Math. Program, 1989, vol. 45, p. 139–172.

    Article  MathSciNet  MATH  Google Scholar 

  2. Bondarenko, V.A. and Uryvaev, B.V., On one problem of integer optimization, Autom. Remote Control, 2007, vol. 68, no. 6, p. 948–953.

    Article  MathSciNet  MATH  Google Scholar 

  3. Bondarenko, V.A. and Maksimenko, A.N., Geometricheskie konstruktsii i slozhnost’ v kombinatornoi optimizatsii (Geometric Constructs and Complexity in Combinatorial Optimization), Moscow: LKI, 2008.

    Google Scholar 

  4. Bondarenko, V.A. and Nikolaev, A.V., A class of hypergraphs and vertices of cut polytope relaxations, Dokl. Math., 2012, vol. 85, no. 1, p. 46–47.

    Article  MathSciNet  MATH  Google Scholar 

  5. Christof, T. and Reinelt, G., Efficient parallel facet enumeration for 0/1-polytopes. Technical report, Universitat Heidelberg, 1997.

    Google Scholar 

  6. Deza, M.M. and Laurent, M., Geometry of Cuts and Metrics (Algorithms and Combinatorics), Springer, 2009, ed. 2.

    Google Scholar 

  7. Bondarenko, V.A. and Nikolaev, A.V., Similarity of various relaxations of cut polyhedron, in Research of the Computer Science Department: Collected Papers for the 25th Anniversary of the Department, Yaroslavl, 2011, p. 17–21.

    Google Scholar 

  8. Nikolaev, A.V., Hypergraphs of special type and cut polytope relaxations properties analysis, Model. Anal. Inform. Sist., 2011, vol. 18, no. 3, p. 82–100.

    Google Scholar 

  9. Bondarenko, V.A. and Nikolaev, A.V., Some properties of cut polytope relaxations, Yaroslavl Pedag. Vestn., 2011, vol. 3, no. 2, p. 23–29.

    Google Scholar 

  10. Laurent, M., Graphic vertices of the metric polytope, Discrete Math., 1996, vol. 151, nos. 1–3, pp. 131–153.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. A. Bondarenko.

Additional information

Original Russian Text © V.A. Bondarenko, A.V. Nikolaev, 2014, published in Modelirovanie i Analiz Informatsionnykh Sistem, 2014, No. 4, pp. 25–34.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bondarenko, V.A., Nikolaev, A.V. On fractional faces of the metric polytope. Aut. Control Comp. Sci. 49, 608–614 (2015). https://doi.org/10.3103/S0146411615070032

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411615070032

Keywords