1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall Englewood Cliffs (1993)
2. Bertsekas, D.P.: An auction algorithm for shortest paths. SIAM J. Optim. 1, 425–447 (1991)
3. Bertsekas, D.P.: Dynamic Programming and Optimal Control. 3rd Edition, Vol. I. Athena Scientific (2005)
4. Bertsekas, D.P., Pallottino, S., Scutellà, M.G.: Polynomial auction algorithms for shortest paths. Comput. Optim. Appl. 4, 99–125 (1995)
5. Cerulli, R., Festa, P., Raiconi, G.: Graph collapsing in shortest path auction algorithms. Comput. Optim. Appl. 18, 199–220 (2001)