Claudio Contardo, Guy Desaulniers
and François Lessard
Article (2015)
An external link is available for this item
| Department: | Department of Mathematics and Industrial Engineering |
|---|---|
| PolyPublie URL: | https://publications.polymtl.ca/11247/ |
| Journal Title: | Networks (vol. 65, no. 1) |
| Publisher: | Wiley-Liss |
| DOI: | 10.1002/net.21594 |
| Official URL: | https://doi.org/10.1002/net.21594 |
| Date Deposited: | 18 Apr 2023 15:06 |
| Last Modified: | 18 Apr 2023 15:06 |
| Cite in APA 7: | Contardo, C., Desaulniers, G., & Lessard, F. (2015). Reaching the elementary lower bound in the vehicle routing problem with time windows. Networks, 65(1), 88-99. https://doi.org/10.1002/net.21594 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
