New parallel randomized algorithms for the traveling salesman problem (Q1302601)

From MaRDI portal
Revision as of 03:52, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New parallel randomized algorithms for the traveling salesman problem
scientific article

    Statements

    New parallel randomized algorithms for the traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    25 July 2000
    0 references
    0 references
    optimization
    0 references
    randomized algorithm
    0 references
    parallel algorithm
    0 references
    traveling salesman problem
    0 references