NotesFAQContact Us
Collection
Advanced
Search Tips
Showing one result Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Mueller, Shane T.; Perelman, Brandon S.; Tan, Yin Yin; Thanasuan, Kejkaew – Journal of Problem Solving, 2015
The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points ("cities") that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual…
Descriptors: Sales Occupations, Salesmanship, Computer System Design, Computer Software Reviews