 |
The traveling salesman problem is perhaps the best known of the NP-complete problems. These are the most difficult problems in the class known as NP (nondeterministic polynomial time), where no efficient, or polynomial time, algorithm has been discovered to solve one. As such, the traveling salesman problem makes an excellent introduction to the concept of combinatorial complexity. In this note we will show how the Combinatorica package and some simple greedy algorithms can be easily harnessed to bring these concepts into the classroom.
|
|
For the newest resources, visit Wolfram Repositories and Archives »
