A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem (Q1130068): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:17, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem |
scientific article |
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
