The problem is certainly not a closed one, and I hope more research will be done, both toward finding better computational methods, and toward a better mathematical understanding of the problem.
—Delbert Ray Fulkerson, 1956.1
The beauty of the TSP will no doubt continue to attract mathematicians and computer scientists for years to come.
Christos Papadimitriou told me that the traveling salesman problem is not a problem, it’s an addiction.
—Jon Bentley, 1991.2
It’s addictive. No matter how much progress you make, you always have the nagging feeling that you still did not nail down a couple of hunches that could bring about another quantum leap.
—Vašek Chvátal, 1998.3
We offer no tips for breaking a TSP addiction. Far from ...