An O(N log N) planar travelling salesman heuristic based on spacefilling curves (Q1166433)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(N log N) planar travelling salesman heuristic based on spacefilling curves |
scientific article; zbMATH DE number 3769367
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(N log N) planar travelling salesman heuristic based on spacefilling curves |
scientific article; zbMATH DE number 3769367 |
Statements
An O(N log N) planar travelling salesman heuristic based on spacefilling curves (English)
0 references
1982
0 references
spacefilling mapping
0 references
travelling salesman problem
0 references
heuristic
0 references
routing
0 references
implementation
0 references
0 references
