1. H. Achatz, P. Kleinschmidt, and K. Paparrizos, A dual forest algorithm for the assignment problem, in Applied Geometry and Discrete Mathematics, P. Gritzmann and B. Sturmfels, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science 4, AMS, Providence, RI, 1991, pp. 1–11.
2. R. K. Ahuja, T. L. Magnanti, J. B. Orlin, and M. R. Reddy, Applications of network optimization, in Network Models–Handbooks of Operations Research and Management Science 7), M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, eds., Elsevier, Amsterdam, 1995, pp. 1–83.
3. R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan, Faster algorithms for the shortest path problem, Journal of the ACM 37, 1990, 213–223.
4. R. K. Ahuja and J. B. Orlin, The scaling network simplex algorithm, Operations Research 40, Suppl. No. 1, 1992, S5 - S13.
5. M. Akgül, A sequential dual simplex algorithm for the linear assignment problem, Operations Research Letters 7, 1988, 155–158.