On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(86)90188-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966089951 / rank | |||
Normal rank | |||
Revision as of 02:29, 20 March 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
