Fast Algorithms for Geometric Traveling Salesman Problems (Q4024311)

From MaRDI portal
Revision as of 22:22, 23 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Fast Algorithms for Geometric Traveling Salesman Problems
scientific article

    Statements

    Fast Algorithms for Geometric Traveling Salesman Problems (English)
    0 references
    0 references
    25 February 1993
    0 references
    approximate traveling salesman tours
    0 references
    multidimensional point sets
    0 references
    starting heuristics
    0 references
    uniform planar million-city traveling salesman
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references