Stefano Bernagozzi
abstract
The traveling salesman problem (TSP) is a well known complex problem in computer science. It has been demonstrated to be NP-hard and no efficient algorithm has been found for the worst case scenario, but human subjects seems to find good solutions with low effort. For this reason a research has been made on how people solve TSP, and in particular how their solution are compared to computer ones.
outcomes
