<  Back to the Polytechnique Montréal portal

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

Jean-François Cote, Claudia Archetti, Maria Grazia Speranza, Michel Gendreau and Jean-Yves Potvin

Article (2012)

An external link is available for this item
Department: Department of Mathematics and Industrial Engineering
PolyPublie URL: https://publications.polymtl.ca/15604/
Journal Title: Networks (vol. 60, no. 4)
Publisher: Wiley
DOI: 10.1002/net.21459
Official URL: https://doi.org/10.1002/net.21459
Date Deposited: 18 Apr 2023 15:10
Last Modified: 18 Apr 2023 15:10
Cite in APA 7: Cote, J.-F., Archetti, C., Speranza, M. G., Gendreau, M., & Potvin, J.-Y. (2012). A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks, 60(4), 212-226. https://doi.org/10.1002/net.21459

Statistics

Dimensions

Repository Staff Only

View Item View Item