1. H. Achatz, P. Kleinschmidt, and K. Paparrizos, A dual forest algorithm for the assignment problem, Tech. Rep., Universität Passau, Germany, 1989.
2. R.K. Ahuja and J.B. Orlin, Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems, Working Paper OR 189–88, M. I. T. 1988
3. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, in, Optimization, Handbooks in Operations Research and Management Science Vol. 1, Eds., G.L. Nemhauser, A.H.G. Rinnoy Kan, and M.J. Todd, ( Nort-Holland, New York, 1989 ).
4. R.K. Ahuja, K. Mehlhorn, J.B. Orlin, and R.E. Tarjan, Faster Algorithms for the Shortest Path Problem, Journal of ACM 37 (1990) 213–223.
5. M. Akgiil, Topics in Relaxation and Ellipsoidal Methods,(Pitman, London, 1984. Research Notes in Mathematics Vol. 97.)