A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem (Q1130068)
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: A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem |
scientific article; zbMATH DE number 1191370
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem |
scientific article; zbMATH DE number 1191370 |
Statements
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem (English)
0 references
16 August 1998
0 references
heuristics
0 references
computational analysis
0 references
asymmetric travelling salesman
0 references
bound
0 references
0 references
0 references
