✦ LIBER ✦

Management of Railroad Impedances for Shortest Path-based Routing

✍ Scribed by Jeff Day; George L. Nemhauser; Joel S. Sokol

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic algorithms for the shortest path

✍ Misra, S.; Oommen, B.J. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 622 KB

Analysis of Shortest Path Routing for La

✍ Sungoh Kwon, ; Shroff, N.B. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 950 KB

Analysis of shortest-path routing algori

✍ Wang, Zheng; Crowcroft, Jon 📂 Article 📅 1992 🏛 Association for Computing Machinery 🌐 English ⚖ 601 KB

An overview of constraint-based path sel

✍ Kuipers, F.; Van Mieghem, P.; Korkmaz, T.; Krunz, M. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 86 KB

Selective assign shortest path first alg

✍ Tan, S.C.; Abbou, F.M.; Ewe, H.T. 📂 Article 📅 2009 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 233 KB

An application of the successive shortes

✍ Phuong H. Nguyen; Wil L. Kling; Johanna M.A. Myrzik 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 923 KB