Time-dependent shortest path problems with penalties and limits on waiting
Edward He, Natashia Boland, George Nemhauser, Martin Savelsbergh
| Year of publication: |
2021
|
|---|---|
| Authors: | He, Edward ; Boland, Natashia ; Nemhauser, George L. ; Savelsbergh, Martin W. P. |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 3, p. 997-1014
|
| Subject: | shortest path | time-dependent travel time | time-expanded network | computational complexity | Transportzeit | Travel time | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2020.0985 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012631638