Boolean quadric polytopes are faces of linear ordering polytopes

DOI10.17377/semi.2017.14.055zbMath1370.90296arXiv1704.06170OpenAlexW2609891207MaRDI QIDQ2403680

Aleksandr N. Maksimenko

Publication date: 11 September 2017

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.06170

zbMATH Keywords

stable set polytopeaffine equivalenceBoolean quadric polytopelinear ordering polytopedouble covering polytope

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Extended formulations for order polytopes through network flows ⋮ Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\Phi\)-harmonic functions on discrete groups and the first \(\ell^\Phi\)-cohomology
• An analog of the Cook theorem for polytopes
• \(k\)-neighborly faces of the Boolean quadric polytopes
• The common face of some 0/1-polytopes with NP-complete nonadjacency relation
• A short proof that the extension complexity of the correlation polytope grows exponentially
• How to recycle your facets
• Exponential Lower Bounds for Polytopes in Combinatorial Optimization
• A new proof of Gromov’s theorem on groups of polynomial growth
• Reducibility among Combinatorial Problems
• Geometry of cuts and metrics