1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs: Prentice-Hall.
2. Balakrishnan, A., Magnanti, T. L., & Mirchandani, P. (1997). Network design. In M. Dell’Amico, F. Maffioli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization (Chap. 18). Chichester: Wiley.
3. Balakrishnan, A., Magnanti, T. L., & Wong, R. T. (1989). A dual-ascent procedure for large-scale uncapacitated network design. Operations Research, 37, 716–740.
4. Chvátal, V. (2002). Linear programming. New York: W.H. Freeman and Company.
5. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms (2nd ed.). Cambridge: MIT.