Divide and conquer strategies for parallel TSP heuristics (Q1919776)

From MaRDI portal
Revision as of 06:14, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Divide and conquer strategies for parallel TSP heuristics
scientific article

    Statements

    title
    Divide and conquer strategies for parallel TSP heuristics (English)
    0 references
    author
    Giovanni Cesari
    0 references
    publication date
    24 July 1996
    0 references
    zbMATH DE Number
    909728
    0 references
    zbMATH Keywords
    geometric traveling salesman problem
    0 references
    divide und conquer strategies
    0 references
    parallel heuristics
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1919776&oldid=26594964"
    Powered by MediaWiki