ISE/OR/MA766 References

Textbooks

  1. E. Lawler, “Combinatorial Optimization: Networks and Matroids”, Holt, Rinehart and Winston, New York, 1976. Dover 0-486-41453-1 (2001). Dover Publications
  2. D.P.Bertsekas, “Network Optimization: Continuous and Discrete Models”, Athena Scientific, Belmont, MA, 1998.

References

  1. R. T. Rockafellar, “Network Flows and Monotropic Optimization”, Wiley-Interscience, 1984.
  2. M. S. Bazaraa, J. J. Jarvis, H. D. Sherali, “Linear Programming and Network Flows”, John Wiley and Sons, 2nd Edition, 1990.
  3. D. P. Bertsekas, “Linear Network Optimization”, The MIT Press, 1991.
  4. K. G. Murty, “Network Programming”, Prentice Hall, 1992.
  5. J. R. Evans, E. Minieka, “Optimization Algorithms for Networks and Graphs”, Marcel Dekker, 1992.
  6. R. K. Ahuja, T. L. Magnanti, J. B. Orlin, “Network Flows”, Prentice Hall, 1993.
  7. F. Glover, D. Klingman, V. Phillips, “Network Models in Optimization and Their Applications in Practice”, John Wiley & Sons, 1992.
  8. D. Jungnickel, “Graphs, Networks and Algorithms”, Springer-Verlag Berlin Heidelberg, 2008 (3rd Ed.)
  9. B. Korte, J. Vygen, “Combinatorial Optimization”, Springer-Verlag Berlin Heidelberg, 2008 (4th Ed.)