Traveling salesman polytopes and cut polytopes. Affine reducibility

DOI10.1515/DMA-2013-018zbMATH Open1321.90117OpenAlexW2322379610MaRDI QIDQ5249787FDOQ5249787

Authors: Aleksandr N. Maksimenko 

Publication date: 12 May 2015

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2013-018

Recommendations

• On the facial structure of symmetric and graphical traveling salesman polyhedra
• On the graphical relaxation of the symmetric traveling salesman polytope
• The Steiner Traveling Salesman Polytope and Related Polyhedra
• All 0-1 polytopes are traveling salesman polytopes
• Hamiltonian path and symmetric travelling salesman polytopes

zbMATH Keywords

cut polytopetraveling salesman polytope

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (1)

• Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes

This page was built for publication: Traveling salesman polytopes and cut polytopes. Affine reducibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249787)