Treffer: Finding the first K shortest paths in a time-window network
Title:
Finding the first K shortest paths in a time-window network
Authors:
Chen, Yen-Liang a, *, Yang, Hsu-Hao b
Source:
In Computers and Operations Research 2004 31(4):499-513
Database:
ScienceDirect