1. Achatz, A., Paparrizos, K., Samaras, N., & Tsiplidis, K. (2002). A forest exterior point algorithm for assignment problems. In M. P. Pardalos, A. Midgalas, & R. Buckard (Eds.), Combinatorial and global optimization, chap. Combinatorial and global optimization (pp. 1–10). Singapore: Word Scientific.
2. Achatz, H., Kleinschmidt, P., & Paparrizos, K. (1991). A dual forest algorithm for the assignment problem. In Applied geometry and discrete mathematics: The Victor Klee Festschrift (Vol. 4, pp. 1–10). London: AMS & ACM.
3. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms and applications. Englewood Cliffs, NJ: Prentice Hall.
4. Ahuja, R. K., Magnanti, T. L., Orlin, J. B., & Reddy, M. R. (1995). Applications of network optimization. In M. O. Ball, T. L. M. C. L. Monma, & G. L. Nemhauser (Eds.), Network models, vol. 7, chap. Handbooks of operations research and management science (pp. 1–83). Amsterdam: Elsevier, North-Holland.
5. Ahuja, R. K., & Orlin, J. B. (1992). The scaling network simplex algorithm. Operations Research, 40(Supp. No. 1), S5–S13.