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

DOI<193::AID-NET6>3.0.CO;2-A 10.1002/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-AzbMath1002.90084OpenAlexW2053697731MaRDI QIDQ4540047

Could not fetch data.

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199805)31:3<193::aid-net6>3.0.co;2-a

Mathematics Subject Classification ID

Could not fetch data.