Algorithms for minimum-cost paths in time-dependent networks with waiting policies

Brian C. Dean. Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks, 44(1):41-46, 2004. [doi]

@article{Dean04,
  title = {Algorithms for minimum-cost paths in time-dependent networks with waiting policies},
  author = {Brian C. Dean},
  year = {2004},
  doi = {10.1002/net.20013},
  url = {http://dx.doi.org/10.1002/net.20013},
  tags = {C++},
  researchr = {https://researchr.org/publication/Dean04},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {44},
  number = {1},
  pages = {41-46},
}