The Traveling Salesman Problem and its Variations

By J. Monnot, Sophie Toulouse. 2014

121 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/dee183b57692a19493aed54751b99202d7ae635e

How researchers see this paper

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

In Artificial Intelligence

1. Aziz Ouaarab
2. Belaïd Ahiod
3. Xin-She Yang
4. Arpan Kumar Kar
5. Xingshi He
6. Seyed Mohammad Mirjalili
7. Seyedali Mirjalili
8. Amir H. Gandomi

In Computer Networks and Communications

1. Xin-She Yang
2. Seyed Mohammad Mirjalili
3. Sankalap Arora
4. Heitor Silvério Lopes
5. Satvir Singh
6. Rafael Stubs Parpinelli

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

• Discrete cuckoo search algorithm for the travelling salesman problem (2014, background): “The Traveling salesman problem (TSP) [15, 18] is defined by N cities and distance matrix D = (dij)N 9 N which gives distances between all pairs of cities.”