Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks

Marilène Cherkesly, Guy Desaulniers, Stefan Irnich and Gilbert Laporte

Technical Report (2015)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Research Center:	GERAD - Research Group in Decision Analysis CIRRELT - Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation
PolyPublie URL:	https://publications.polymtl.ca/64043/
Report number:	G-2015-25
Official URL:	https://www.gerad.ca/fr/papers/G-2015-25
Date Deposited:	28 Apr 2025 15:37
Last Modified:	28 Apr 2025 15:37

Cite in APA 7:	Cherkesly, M., Desaulniers, G., Irnich, S., & Laporte, G. (2015). Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. (Technical Report n° G-2015-25). https://www.gerad.ca/fr/papers/G-2015-25
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