<  Back to the Polytechnique Montréal portal

A branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows

Tayeb Mhamedi, Henrik Andersson, Marilène Cherkesly and Guy Desaulniers

Technical Report (2020)

An external link is available for this item
Department: Department of Mathematics and Industrial Engineering
Research Center: GERAD - Research Group in Decision Analysis
PolyPublie URL: https://publications.polymtl.ca/64250/
Report number: G-2020-63
Official URL: https://www.gerad.ca/fr/papers/G-2020-63
Date Deposited: 27 Mar 2025 17:05
Last Modified: 27 Mar 2025 17:05
Cite in APA 7: Mhamedi, T., Andersson, H., Cherkesly, M., & Desaulniers, G. (2020). A branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows. (Technical Report n° G-2020-63). https://www.gerad.ca/fr/papers/G-2020-63

Statistics

Stats are not available on this system.

Repository Staff Only

View Item View Item