An approximation algorithm for k-depot split delivery vehicle routing problem
Year of publication: |
2023
|
---|---|
Authors: | Lai, Xiaofan ; Xu, Liang ; Xu, Zhou ; Du, Yang |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 35.2023, 5, p. 1179-1194
|
Subject: | approximation algorithm | multiple depot | split delivery | vehicle routing problem | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
The split delivery vehicle routing problem with three-dimensional loading constrains
Bortfeldt, Andreas, (2018)
-
The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints
Bortfeldt, Andreas, (2020)
-
Pessoa, Artur, (2025)
- More ...
-
Purchasing transportation services from ocean carriers
Xu, Zhou, (2015)
-
Improved algorithms for joint optimization of facility locations and network connections
Lai, Xiaofan, (2016)
-
Exact and approximation algorithms for the min–max k-traveling salesmen problem on a tree
Xu, Liang, (2013)
- More ...