Finding the K shortest paths in a time-schedule network with constraints on arcs

Wen Jin, Shuiping Chen, Hai Jiang. Finding the K shortest paths in a time-schedule network with constraints on arcs. Computers & OR, 40(12):2975-2982, 2013. [doi]

Authors

Wen Jin

This author has not been identified. Look up 'Wen Jin' in Google

Shuiping Chen

This author has not been identified. Look up 'Shuiping Chen' in Google

Hai Jiang

This author has not been identified. Look up 'Hai Jiang' in Google