Some properties of the skeleton of the pyramidal tours polytope
References (8)
- et al.
Faces of diameter two on the Hamiltonian cycle polytype
Oper. Res. Lett.
(1995) Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms
Autom. Remote Control
(1983)- et al.
On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems
Int. J. Math. Sci.
(2016) - et al.
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
SIAM Rev.
(1998)
There are more references available in the full text version of this article.
Cited by (9)
ON 1-SKELETON OF THE POLYTOPE OF PYRAMIDAL TOURS WITH STEP-BACKS
2022, Siberian Electronic Mathematical ReportsThe Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
2021, Automatic Control and Computer SciencesOn vertex adjacencies in the polytope of pyramidal tours with step-backs
2019, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
© 2017 Elsevier B.V. All rights reserved.