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

Article (2016)

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/34110/
Journal Title:	European Journal of Operational Research (vol. 250, no. 3)
Publisher:	Elsevier
DOI:	10.1016/j.ejor.2015.10.046
Official URL:	https://doi.org/10.1016/j.ejor.2015.10.046
Date Deposited:	18 Apr 2023 15:05
Last Modified:	28 Apr 2025 15:27

Cite in APA 7:	Cherkesly, M., Desaulniers, G., Irnich, S., & Laporte, G. (2016). Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. European Journal of Operational Research, 250(3), 782-793. https://doi.org/10.1016/j.ejor.2015.10.046
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