MathMods.eu

Additional Info

• Module Title: Combinatorial optimization
• ECTS credits: 6
• Semester: 3
• University: Autonomous University of Barcelona
• Lecturer 1: Glenn Hurlbert
• Topics: Linear Optimization, Integer Optimization, Graph and Network Optimization, Complexity Theory and Heuristics
• Objectives: This course is an introduction to Combinatorial Optimization at the first-year graduate level. We will also cover and review some important aspects of Linear and Integer Optimization at the start
• Prerequisites: --
• Books: G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, "Complexity and Approximation".
  Springer Verlag, 1999.
  

  Sniedovich, M. (2006), "Dijkstra’s algorithm revisited: the dynamic
  programming connexion Journal of Control and Cybernetics/ *35* (3): 599–620.
  
  Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L,
  "Introduction to Algorithms" (first edition ed.). MIT Press and McGraw-Hill.
  
  Judea Pearl, "Heuristics: Intelligent Search Strategies for Computer
  Problem Solving", Addison-Wesley Pub (Sd) 1984.

• Teaching material 1: --
• Teaching material 2: --
• Teaching Material 3: --
• More information: --