Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem (Q2314406): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(N log N) planar travelling salesman heuristic based on spacefilling curves / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spacefilling curves and the planar travelling salesman problem / rank | |||
Normal rank | |||
Latest revision as of 23:02, 19 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem |
scientific article |
Statements
Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem (English)
0 references
22 July 2019
0 references
spacefilling curve heuristic
0 references
traveling salesman problem
0 references
