On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:35, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem |
scientific article |
Statements
On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (English)
0 references
1986
0 references
approximation algorithms
0 references
minimum and the maximum traveling salesman problem
0 references
heuristics
0 references
