Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem (Q4492397): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q74569469, #quickstatements; #temporary_batch_1711055989931 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Large-step Markov chains for the TSP incorporating local search heuristics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability / rank | |||
Normal rank | |||
Revision as of 11:39, 30 May 2024
scientific article; zbMATH DE number 1477756
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem |
scientific article; zbMATH DE number 1477756 |
Statements
Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem (English)
0 references
16 July 2000
0 references
nearest neighbor distribution
0 references
mean-field approach
0 references
