Name
Abstract | ||
|---|---|---|
We present two approaches for the Euclidean TSP which compute high quality tours for large instances. Both approaches are based on pseudo backbones consisting of all common edges of good tours. The first approach starts with some pre-computed good tours. Using this approach we found record tours for seven VLSI instances. The second approach is window based and constructs from scratch very good tours of huge TSP instances, e. g., the World TSP. |
Year | Venue | Keywords |
|---|---|---|
2009 | CTW | window based approach.,iterative approach,prob- lem contraction,pseudo backbone,euclidean traveling salesman problem,traveling salesman problem,discrete mathematics |
Field | DocType | Citations |
Discrete mathematics,Combinatorics,Computer science,Heuristics,Euclidean geometry | Conference | 2 |
PageRank | References | Authors |
0.38 | 2 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Dong | 1 | 13 | 1.95 |
| Christian Ernst | 2 | 9 | 2.24 |
| Gerold Jäger | 3 | 113 | 14.66 |
| Dirk Richter | 4 | 23 | 2.27 |
| P. Molitor | 5 | 211 | 18.50 |