Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
Computational Complexity
2017-06-20 v3 Discrete Mathematics
Combinatorics
Optimization and Control
Abstract
We consider two polytopes. The quadratic assignment polytope is the convex hull of the set of tensors , , where is the set of permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph we consider appropriate permutation matrix of the edges of . The Young polytope is the convex hull of all such matrices. In 2009, S. Onn showed that the subgraph isomorphism problem can be reduced to optimization both over and over . He also posed the question whether and , having vertices each, are isomorphic. We show that and are not isomorphic. Also, we show that is a face of , but is a projection of .
Cite
@article{arxiv.1705.10081,
title = {Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes},
author = {Aleksandr Maksimenko},
journal= {arXiv preprint arXiv:1705.10081},
year = {2017}
}
Comments
6 pages, translated to English