Undergraduate lesson: Algorithmic Operation Research



  1. F.S. HILLIER and G.J. LIEBERMAN, Introduction to Mathematical Programming, 6th ed., McGraw-Hill, New York.
  2. F.S. HILLIER and G.J. LIEBERMAN, Introduction to Operations Research, Holden Day, Inc., San Francisko, 1980 and new version.
  3. R. K. MARTIN, Large scale linear and integer optimization, Kluwer Academic Publishers, 1999.
  4. R. GARFINKEL and G. NEMHAUSER, Integer programming, New York, John Wiley, 1972.
  5. M. SYSLO, N. DEO, J.S. KOWALIK, Discrete Optimization Algorithms with Pascal Programs, Prentice-Hall, 1983
  6. C. PAPADIMITRIOU, K. STEIGLITZ, Combinatorial Optimization, Prentice-Hall, 1982.
  7. E. AARTS & J.-K. LENSTRA, Local Search in Combinatorial Optimization, John Wiley & Sons, 1997.
  8. Th. H. CORMEN, CH. E. LEISERSON, R.L. RIVEST, Introduction to algorithms, MIT-Press, 2000.
  9. Vijay V. Vazirani, Approximation Algorithms, 1st Edition, Springer Verlag, August 9, 2001,
    ISBN: 3540653678
  10. Laurence A. Wolsey, George L. Nemhauser, Integer and Combinatorial Optimization, 1st Edition, Wiley Interscience, November 15, 1999, ISBN: 0471359432

Current Lesson