Solving Traveling Salesman Problem With a non-complete Graph
One of the simplest, but still NP-hard, routing problems is the Traveling Salesman Problem (TSP). In the TSP, one is given a set of cities and a way of measuring the distance between cities. One has to find the shortest tour that visits all cities exactly once and returns back to the starting city....
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/4906 |
Search Result 1