Shortest Path Problem With Time Windows and Linear Waiting Costs

Guy Desaulniers and Daniel Villeneuve

Article (2000)

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/28234/
Journal Title:	Transportation Science (vol. 34, no. 3)
Publisher:	Institute for Operations Research and the Management Sciences
DOI:	10.1287/trsc.34.3.312.12298
Official URL:	https://doi.org/10.1287/trsc.34.3.312.12298
Date Deposited:	18 Apr 2023 15:21
Last Modified:	11 Jun 2025 08:59

Cite in APA 7:	Desaulniers, G., & Villeneuve, D. (2000). Shortest Path Problem With Time Windows and Linear Waiting Costs. Transportation Science, 34(3), 312-319. https://doi.org/10.1287/trsc.34.3.312.12298
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