On the worst-case performance of some algorithms for the asymmetric traveling salesman problem (Q3936521): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57401646, #quickstatements; #temporary_batch_1712201099914 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An extension of Christofides heuristic to the k-person travelling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank | |||
Normal rank | |||
Latest revision as of 15:02, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the worst-case performance of some algorithms for the asymmetric traveling salesman problem |
scientific article |
Statements
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem (English)
0 references
1982
0 references
worst-case performance
0 references
asymmetric traveling salesman problem
0 references
comparison of heuristic algorithms
0 references
n city problem
0 references
