Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study (Q2884495)

From MaRDI portal
Revision as of 10:20, 22 August 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
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
scientific article

    Statements

    Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study (English)
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic programming
    0 references
    algorithms
    0 references
    complexity
    0 references
    heuristics
    0 references
    vehicle routing
    0 references
    traveling salesman problem
    0 references