The Travelling Salesman Problem in symmetric circulant matrices with two stripes
From MaRDI portal
(Redirected from Publication:5458063)
Recommendations
- The traveling salesman problem in circulant weighted graphs with two stripes
- The two-stripe symmetric circulant TSP is in P
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- Hamiltonian cycles in circulant digraphs with two stripes
- Efficiently solvable special cases of bottleneck travelling salesman problems
Cites work
- A solution of the isomorphism problem for circulant graphs
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Hamiltonian cycles in circulant digraphs with two stripes
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- On hamiltonian Toeplitz graphs
Cited in
(11)- The travelling salesman problem on permuted Monge matrices
- The maximum travelling salesman problem on symmetric Demidenko matrices
- The two-stripe symmetric circulant TSP is in P
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- The traveling salesman problem in circulant weighted graphs with two stripes
- Characterizing the integrality gap of the subtour LP for the circulant traveling salesman problem
- Development of an algorithm for solving an asymmetric routing problem based on the ant colony method
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- The two-stripe symmetric circulant TSP is in P
- Circulant TSP: vertices of the edge-length polytope and superpolynomial lower bounds
- Circulant TSP special cases: easily-solvable cases and improved approximations
This page was built for publication: The Travelling Salesman Problem in symmetric circulant matrices with two stripes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458063)
