Table of Contents
Traveling Saleman Problem (TSP)
About
The TSP is not
NP Complete
but NP hard.
Articles Related
Algorithm - NP Complete (Nondeterministic Polynomial Time Complete)
Simulation
See
AgentScript model
Documentation / Reference
No, The TSP Isn't NP Complete
TSP for Rugby Fan