The Euclidean vehicle routing problem with multiple depots and time windows
From MaRDI portal
Publication:1708638
DOI10.1007/978-3-319-71147-8_31zbMath1474.90065OpenAlexW2769656066MaRDI QIDQ1708638
Publication date: 26 March 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-71147-8_31
approximation algorithmmodern logisticsEuclidean Vehicle Routing problem (VRP)multiple depots and time windows (MDTW)
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
This page was built for publication: The Euclidean vehicle routing problem with multiple depots and time windows
