Dynamic discretization discovery algorithms for time-dependent shortest path problems
Edward Yuhang He, Natashia Boland, George Nemhauser, Martin Savelsbergh
| Year of publication: |
2022
|
|---|---|
| Authors: | He, Edward Yuhang ; Boland, Natashia ; Nemhauser, George L. ; Savelsbergh, Martin W. P. |
| Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 2, p. 1086-1114
|
| Subject: | dynamic discretization discovery | fastest paths | minimum duration paths | time discretization | time-dependent travel times | time-expanded networks | Theorie | Theory | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2021.1084 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10013361436