A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One (Q3937162): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055038236 / rank
 
Normal rank

Latest revision as of 00:56, 20 March 2024

scientific article
Language Label Description Also known as
English
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
scientific article

    Statements

    A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One (English)
    0 references
    0 references
    0 references
    1982
    0 references
    traveling salesman problem
    0 references
    minimal tour length
    0 references
    probabilistic algorithm
    0 references

    Identifiers