Fast Algorithms for Geometric Traveling Salesman Problems (Q4024311): 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.1287/ijoc.4.4.387 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2102076751 / rank | |||
Normal rank | |||
Revision as of 21:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Algorithms for Geometric Traveling Salesman Problems |
scientific article |
Statements
Fast Algorithms for Geometric Traveling Salesman Problems (English)
0 references
25 February 1993
0 references
approximate traveling salesman tours
0 references
multidimensional point sets
0 references
starting heuristics
0 references
uniform planar million-city traveling salesman
0 references
