The Travelling Salesman Problem in symmetric circulant matrices with two stripes

DOI10.1017/S0960129508006609zbMath1172.90476MaRDI QIDQ5458063

Ivan Gerace, Federico Greco

Publication date: 10 April 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

upper bound

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (5)

The two-stripe symmetric circulant TSP is in P ⋮ Development of an algorithm for solving an asymmetric routing problem based on the ant colony method ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ A comparison of lower bounds for the symmetric circulant traveling salesman problem ⋮ Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem

Cites Work

• Hardness results and spectral techniques for combinatorial problems on circulant graphs
• Efficiently solvable special cases of bottleneck travelling salesman problems
• On hamiltonian Toeplitz graphs
• Hamiltonian cycles in circulant digraphs with two stripes
• A solution of the isomorphism problem for circulant graphs

This page was built for publication: The Travelling Salesman Problem in symmetric circulant matrices with two stripes