A generalized threshold algorithm for the shortest path problem with time windows.
W. Powell, and Z. Chen. Network Design: Connectivity and Facilities Location, volume 40 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 303-318. DIMACS/AMS, (1997)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/dimacs/PowellC97
%A Powell, Warren B.
%A Chen, Zhi-Long
%B Network Design: Connectivity and Facilities Location
%D 1997
%E Pardalos, Panos M.
%E Du, Ding-Zhu
%I DIMACS/AMS
%K dblp
%P 303-318
%T A generalized threshold algorithm for the shortest path problem with time windows.
%U http://dblp.uni-trier.de/db/conf/dimacs/dimacs40.html#PowellC97
%V 40
%@ 978-0-8218-0834-4
@inproceedings{conf/dimacs/PowellC97,
added-at = {2022-06-09T00:00:00.000+0200},
author = {Powell, Warren B. and Chen, Zhi-Long},
biburl = {https://www.bibsonomy.org/bibtex/2dda032a707a3b6171b50c58bd397f4cc/dblp},
booktitle = {Network Design: Connectivity and Facilities Location},
crossref = {conf/dimacs/dimacs40},
editor = {Pardalos, Panos M. and Du, Ding-Zhu},
ee = {https://doi.org/10.1090/dimacs/040/18},
interhash = {ec7a29b7e97d9ee4469cdc400ffe152e},
intrahash = {dda032a707a3b6171b50c58bd397f4cc},
isbn = {978-0-8218-0834-4},
keywords = {dblp},
pages = {303-318},
publisher = {DIMACS/AMS},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
timestamp = {2024-04-09T17:58:18.000+0200},
title = {A generalized threshold algorithm for the shortest path problem with time windows.},
url = {http://dblp.uni-trier.de/db/conf/dimacs/dimacs40.html#PowellC97},
volume = 40,
year = 1997
}