Divide and conquer strategies for parallel TSP heuristics (Q1919776)

From MaRDI portal
Revision as of 13:42, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Divide and conquer strategies for parallel TSP heuristics
scientific article

    Statements

    Divide and conquer strategies for parallel TSP heuristics (English)
    0 references
    0 references
    24 July 1996
    0 references
    0 references
    geometric traveling salesman problem
    0 references
    divide und conquer strategies
    0 references
    parallel heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references