Computational experience with an algorithm for finding the k shortest paths in a network
Douglas R. Shier · Journal of Research of the National Bureau of Standards Section B Mathematical Sciences · 1974
A particular co mpute r imple me ntation of th e Doubl e-Sweep method for calcu latin g t.h e k shortes t paths in a net work is described .Res ults are prese nted for a series of co mput ati onal expe rim ent.s perform ed on rectan gular grid network s.