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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.