1. Determining the k-th shortest path by matrix method;Bako;Szigma,1977
2. Brander AW, Sinclair MC. A comparative study of k-shortest path algorithms. In: Proc. 11th UK performance engineering workshop for computer and telecommunications Systems; September 1995.
3. Carraresi P, Sodini C. A binary enumeration tree to find K shortest paths. In: Proc. 7th Symp. operations research. p. 177–88. Athen¨aum/Hain/Hanstein, Methods Oper. Res. 1983;45.
4. Consiglio A, Pecorella A. Using simulated annealing to solve the K-shortest path problem. In: Proc. conf. Italian assoc. operations research; September 1995.
5. Fox BL. K-th shortest paths and applications to the probabilistic networks. In: ORSA/TIMS joint national meeting, vol.23; 1975. p. B263.