People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours
PloS ONE, 5(7), e11685 · 2010
About this work
Cite this work
Daniel E Acuna; Víctor Parada (2010). People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours. PloS ONE, 5(7), e11685.
@article{acuna2010people,
title = {People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours},
author = {Acuna, Daniel E and Parada, V{\'\i}ctor},
year = {2010},
journal = {PloS ONE},
volume = {5},
number = {7},
pages = {e11685},
publisher = {Public Library of Science San Francisco, USA},
url = {https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0011685}
}