The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562)
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: The optimum assignments and a new heuristic approach for the traveling salesman problem |
scientific article; zbMATH DE number 3813372
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The optimum assignments and a new heuristic approach for the traveling salesman problem |
scientific article; zbMATH DE number 3813372 |
Statements
The optimum assignments and a new heuristic approach for the traveling salesman problem (English)
0 references
1982
0 references
network approach
0 references
error bounds
0 references
Karp's patching algorithm
0 references
nonsymmetric traveling salesman
0 references
assignment problem
0 references
augmentation procedure
0 references
suboptimum tours
0 references
heuristic algorithm
0 references
n by n traveling salesman
0 references
comparison of algorithms
0 references
NP-hardness
0 references
0 references
0 references
