Title: Combinatorial Traveling Salesman Problem Algorithms
Abstract: Abstract The traveling salesman problem (TSP) is a fundamental and well‐known problem in combinatorial optimization. We start by reviewing some of its ancestors, including the famous Hamiltonian cycle problem of which the TSP is the weighted version. We then introduce the most famous formulations of both the symmetric and the asymmetric TSP, and describe combinatorial approaches for both versions of the problem. We conclude with a brief discussion on the available TSP software.
Publication Year: 2011
Publication Date: 2011-01-01
Language: en
Type: other
Indexed In: ['crossref']
Access and Citation
Cited By Count: 11
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot