Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem (Q4492397): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1103/PhysRevLett.76.1188 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q74569469 / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1103/physrevlett.76.1188 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059506221 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1103/PHYSREVLETT.76.1188 / rank
 
Normal rank

Latest revision as of 06:26, 30 December 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
    0 references
    0 references
    16 July 2000
    0 references
    nearest neighbor distribution
    0 references
    mean-field approach
    0 references

    Identifiers