English version:
Journal of Applied and Industrial Mathematics, 2016, 10:3, 370-379

Volume 23, No 3, 2016, P. 61-80

UDC 519.854
A. N. Maksimenko
Complexity of combinatorial optimization problems in terms of face lattice of associated polytopes

This paper deals with the following question: Can combinatorial properties of polytopes help in finding an estimate for the complexity of the corresponding optimization problem? Sometimes, these key characteristics of complexity were the number of hyperfaces of the polytope, diameter and clique number of the graph of the polytope, the rectangle covering number of the vertex-facet incidence matrix, and some other characteristics. In this paper, we provide several families of polytopes for which the above-mentioned characteristics differ significantly from the real computational complexity of the corresponding optimization problems. In particular, we give two examples of discrete optimization problem whose polytopes are combinatorially equivalent and they have the same lengths of the binary representation of the coordinates of the polytope vertices. Nevertheless, the first problem is solvable in polynomial time, while the second problem has exponential complexity.
Ill. 1, bibliogr. 22.

Keywords: NP-complex problem, vertex-facet incidence matrix, combinatorial equivalence, graph of a polytope, graph clique number, extended formulation, cyclic polytope.

DOI: 10.17377/daio.2016.23.515

Alexander N. Maksimenko 1
1. Yaroslavl State University,
14 Sovetskaya St., 150000 Yaroslavl, Russia
e-mail: maximenko.a.n@gmail.com

Received 13 October 2015
Revised 19 April 2016


[1] V. A. Bondarenko and A. N. Maksimenko, Geometricheskie konstruktsii i slozhnost’ v kombinatornoi optimizatsii (Geometric Constructions and Complexity in Combinatorial Optimization), LKI, Moscow, 2008.

[2] V. A. Bondarenko and A. V. Nikolaev, Combinatorial and geometric properties of the Max-Cut and Min-Cut problems, Dokl. Akad. Nauk, 452, No. 2, 127–129, 2013. Translated in Dokl. Math., 88, No. 2, 516–517, 2013.

[3] Deza M. M. and M. Laurent, Geometry of Cuts and Metrics, Springer, Heidelberg, 1997 (Algorithms Comb., Vol. 15). Translated under the title Geometriya razrezov i metrik, MTsNMO, Moscow, 2001.

[4] A. N. Maksimenko, The common face of some 0/1-polytopes with NP-complete nonadjacency relation, Fundam. Prikl. Mat., 18, No. 2, 105–118, 2013. Translated in J. Math. Sci., 203, No. 6, 823–832, 2014.

[5] A. N. Maksimenko, Characteristics of complexity: Clique number of a polytope graph and rectangle covering number, Model. Anal. Inf. Sist., 21, No. 5, 116–130, 2014.

[6] A. N. Maksimenko, The simplest families of polytopes associated with NP-hard problems, Dokl. Akad. Nauk, 460, No. 3, 272–274, 2015. Translated in Dokl. Math., 91, No. 1, 53–55, 2015.

[7] G. M. Ziegler, Lectures on Polytopes, Springer, New York, 1995 (Grad. Texts Math., Vol. 152). Translated under the title Teoriya mnogogrannikov, MTsNMO, Moscow, 2014.

[8] D. L. Applegate, R. M. Bixby, V. Chv´atal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study, Princeton Univ. Press, Princeton, NJ, USA, 2007.

[9] Yu. Bogomolov, S. Fiorini, A. N. Maksimenko, and K. Pashkovich, Small extended formulations for cyclic polytopes, Discrete Comput. Geom., 53, No. 4, 809–816, 2015.

[10] M. Conforti, G. Cornuéjols, and G. Zambelli, Extended formulations in combinatorial optimization, Ann. Oper. Res., 204, No. 1, 97–143, 2013.

[11] G. B. Dantzig, D. R. Fulkerson, and S. M. Johnson, Solution of a large-scale traveling salesman problem, Oper. Res., 2, No. 4, 393–410, 1954.

[12] S. Fiorini, V. Kaibel, K. Pashkovich, and D. O. Theis, Combinatorial bounds on nonnegative rank and extended formulations, Discrete Math., 313, No. 1, 67–83, 2013.

[13] S. Fiorini, S. Massar, S. Pokutta, H. R. Tiwary, and R. de Wolf, Exponential lower bounds for polytopes in combinatorial optimization, J. ACM, 62, No. 2, 17:1–17:23, 2015.

[14] S. Fiorini, T. Rothvoß, and H. R. Tiwary, Extended formulations for polygons, Discrete Comput. Geom., 48, No. 13, 658–668, 2012.

[15] B. Grünbaum, Convex Polytopes, Springer, New York, 2003 (Grad. Texts Math., Vol. 221).

[16] V. Kaibel, Extended formulations in combinatorial optimization, Optima, Math. Optim. Soc. Newsl., No. 85, 2–7, 2011.

[17] V. Kaibel and M. E. Pfetsch, Computing the face lattice of a polytope from its vertex-facet incidences, Comput. Geom., 23, No. 3, 281–290, 2002.

[18] V. Kaibel and S. Weltge, A short proof that the extension complexity of the correlation polytope grows exponentially, Discrete Comput. Geom., 53, No. 2, 397–401, 2015.

[19] M. W. Padberg and M. R. Rao, The travelling salesman problem and a class of polyhedra of diameter two, Math. Program., 7, 32–45, 1974.

[20] T. Rothvoß, The matching polytope has exponential extension complexity, Proc. 46th Annual ACM Symp. Theory Comput., New York, USA, May 31–June 3, 2014, pp. 263–272, ACM, New York, 2014.

[21] C. Shannon, Communication theory of secrecy systems, Bell Syst. Techn. J., 28, No. 4, 656–715, 1949.

[22] M. Yannakakis, Expressing combinatorial optimization problems by linear programs, J. Comput. Syst. Sci., 43, No. 3, 441–466, 1991.

 © Sobolev Institute of Mathematics, 2015