1. Sloan W.P. No. 2059-88;R.K. Ahuja,1989
2. R.K. Ahuja and J.B. Orlin, “A fast and simple algorthm for the maximum flow problem,” working paper, M.I.T., Cambridge, MA, 1986 (also in Oper. Res., vol. 37, 1989, pp. 748–759).
3. J.A. Ajevedo, M.E.S. Costa, J.J.S. Madeira, and E.V. Martins, “An algorithm for the ranking of shortest paths,” working paper, Universidade de Coimbra, Coimbra, Portugal, 1991.
4. J.A. Ajevedo, J.J.S. Madeira, E.V. Martins, and F.M. Pires, “A computational improvement for a shortest paths ranking algorithm,” working paper, Universidade de Coimbra, Coimbra, Portugal, 1991.
5. D.P. Bertsekas, “The auction algorithm for shortest paths,” SIAM J. on Optimization, vol. 1, 1991, pp. 425–447.