3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417)

From MaRDI portal
Revision as of 23:16, 5 July 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
3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
scientific article

    Statements

    3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2012
    0 references
    0 references
    traveling salesman problem
    0 references
    heterogeneous vehicle
    0 references
    0 references