A multiperiod traveling salesman problem: Heuristic algorithms (Q1195106)

From MaRDI portal
Revision as of 06:43, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A multiperiod traveling salesman problem: Heuristic algorithms
scientific article

    Statements

    title
    A multiperiod traveling salesman problem: Heuristic algorithms (English)
    0 references
    author
    Giuseppe Paletta
    0 references
    publication date
    5 October 1992
    0 references
    zbMATH DE Number
    69043
    0 references
    zbMATH Keywords
    traveling salesman
    0 references
    heuristic algorithms
    0 references
    shortest path on a layered network
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1195106&oldid=13255504"
    Powered by MediaWiki