People Efficiently Explore the Solution Space of the Computationally Intractable Traveling Salesman Problem to Find Near-Optimal Tours

Acuna, DE; Parada V.

Más información

Título según WOS: People Efficiently Explore the Solution Space of the Computationally Intractable Traveling Salesman Problem to Find Near-Optimal Tours
Título según SCOPUS: People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours
Título de la Revista: PLOS ONE
Volumen: 5
Número: 7
Editorial: PUBLIC LIBRARY SCIENCE
Fecha de publicación: 2010
Idioma: English
URL: http://dx.plos.org/10.1371/journal.pone.0011685
DOI:

10.1371/journal.pone.0011685

Notas: ISI, SCOPUS