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

From MaRDI portal
Revision as of 19:10, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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