Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading

M. Cherkesly, Guy Desaulniers and G. Laporte

Article (2015)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Research Center:	CIRRELT - Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/34109/
Journal Title:	Transportation Science (vol. 49, no. 4)
Publisher:	Institute for Operations Research and the Management Sciences
DOI:	10.1287/trsc.2014.0535
Official URL:	https://doi.org/10.1287/trsc.2014.0535
Date Deposited:	18 Apr 2023 15:06
Last Modified:	08 Apr 2025 06:55

Cite in APA 7:	Cherkesly, M., Desaulniers, G., & Laporte, G. (2015). Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading. Transportation Science, 49(4), 752-766. https://doi.org/10.1287/trsc.2014.0535
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only