Traveling Salesman Problem

By William Emrouznejad. 2008

615 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/686359a06d16ad4a9e27d6a8025e29d74949c464

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

1. Xin-She Yang
2. Seyed Mohammad Mirjalili
3. Suash Deb
4. Amir H. Gandomi
5. Amir Hossein Alavi
6. Arpan Kumar Kar
7. Xingshi He
8. Laith Mohammad Abualigah

Citations in the corpus

• An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems (2016, background): “It is noteworthy that the most used and well-known routing problems are the Traveling Salesman Problem (TSP) ([Lawler et al.(1985)Lawler, Lenstra, Kan & Shmoys]), and the Vehicle Routing Problem (VRP) ([Christofides(1976)]), which are the focus of a ar X iv :1 60 4.”