A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

Irina Ioachim, Sylvie Gélinas, François Soumis, Jacques Desrosiers. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks, 31(3):193-204, 1998. [doi]

@article{IoachimGSD98,
  title = {A dynamic programming algorithm for the shortest path problem with time windows and linear node costs},
  author = {Irina Ioachim and Sylvie Gélinas and François Soumis and Jacques Desrosiers},
  year = {1998},
  doi = {10.1002/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A},
  url = {http://dx.doi.org/10.1002/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A},
  tags = {programming},
  researchr = {https://researchr.org/publication/IoachimGSD98},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {31},
  number = {3},
  pages = {193-204},
}