Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting

Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh. Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting. INFORMS Journal on Computing, 33(3):997-1014, 2021. [doi]

@article{HeBNS21,
  title = {Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting},
  author = {Edward He and Natashia Boland and George L. Nemhauser and Martin W. P. Savelsbergh},
  year = {2021},
  doi = {10.1287/ijoc.2020.0985},
  url = {https://doi.org/10.1287/ijoc.2020.0985},
  researchr = {https://researchr.org/publication/HeBNS21},
  cites = {0},
  citedby = {0},
  journal = {INFORMS Journal on Computing},
  volume = {33},
  number = {3},
  pages = {997-1014},
}