A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514)

From MaRDI portal
Revision as of 20:23, 17 July 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
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
scientific article

    Statements

    A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (English)
    0 references
    0 references
    0 references
    7 October 1998
    0 references
    0 references
    heuristics
    0 references
    routing
    0 references
    transportation
    0 references
    time dependence
    0 references
    traveling salesman
    0 references
    precedence relationships
    0 references