Cite
HARVARD Citation
Guo, J. et al. (2017). A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs. Journal of algorithms & computational technology. 11 (2), pp. 170-177. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Guo, J. et al. (2017). A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs. Journal of algorithms & computational technology. 11 (2), pp. 170-177. [Online].