Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845)

From MaRDI portal
Revision as of 01:54, 7 October 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
Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem
scientific article

    Statements

    Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (English)
    0 references
    0 references
    0 references
    5 February 2016
    0 references
    0 references
    capacitated vehicle routing problem
    0 references
    polynomial time approximation scheme
    0 references
    iterated tour partition
    0 references