Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
From MaRDI portal
(Redirected from Publication:5865703)
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 .
Recommendations
Cites work
- \(k\)-neighborly faces of the Boolean quadric polytopes
- A short proof that the extension complexity of the correlation polytope grows exponentially
- A study of the quadratic semi-assignment polytope
- An analog of the Cook theorem for polytopes
- Boolean quadric polytopes are faces of linear ordering polytopes
- Exponential lower bounds for polytopes in combinatorial optimization
- Geometry of cuts and metrics
- Geometry, complexity, and combinatorics of permutation polytopes
- scientific article; zbMATH DE number 3659595 (Why is no real title available?)
- scientific article; zbMATH DE number 1173721 (Why is no real title available?)
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation
- The cut cone. III: On the role of triangle facets
- Traveling salesman polytopes and cut polytopes. Affine reducibility
- Two graph isomorphism polytopes
This page was built for publication: Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865703)