An approximation algorithm for the TSP (Q1119485)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approximation algorithm for the TSP |
scientific article; zbMATH DE number 4099067
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the TSP |
scientific article; zbMATH DE number 4099067 |
Statements
An approximation algorithm for the TSP (English)
0 references
1989
0 references
For a given complete weighted graph with n nodes, the authors present a heuristic algorithm with running time \(O(n^ 4)\) for the travelling salesman problem. Experimental studies show that the method gives better results in most cases than the well-known Quick method.
0 references
complete weighted graph
0 references
heuristic algorithm
0 references
travelling salesman
0 references
