Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
- Авторлар: Maksimenko A.1
-
Мекемелер:
- Demidov Yaroslavl’ State University
- Шығарылым: Том 10, № 3 (2016)
- Беттер: 370-379
- Бөлім: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212418
- DOI: https://doi.org/10.1134/S1990478916030078
- ID: 212418
Дәйексөз келтіру
Аннотация
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.
Авторлар туралы
A. Maksimenko
Demidov Yaroslavl’ State University
Хат алмасуға жауапты Автор.
Email: maximenko.a.n@gmail.com
Ресей, ul. Sovetskaya 14, Yaroslavl’, 150000