Complexity of combinatorial optimization problems in terms of face lattice of associated polytopes
A. N. Maksimenko
Yaroslavl State University, 14 Sovetskaya St., 150000 Yaroslavl, Russia
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.
NP-complex problem, vertex-facet incidence matrix, combinatorial equivalence, graph of a polytope, graph clique number, extended formulation, cyclic polytope.
PDF file (311 kB)
Journal of Applied and Industrial Mathematics, 2016, 10:3, 370–379
A. N. Maksimenko, “Complexity of combinatorial optimization problems in terms of face lattice of associated polytopes”, Diskretn. Anal. Issled. Oper., 23:3 (2016), 61–80; J. Appl. Industr. Math., 10:3 (2016), 370–379
Citation in format AMSBIB
\paper Complexity of combinatorial optimization problems in terms of face lattice of associated polytopes
\jour Diskretn. Anal. Issled. Oper.
\jour J. Appl. Industr. Math.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|