Combinatorial optimisation
Additional Info
- ECTS credits: 6
- University: Autonomous University of Barcelona
- Semester: 3
- Lecturer 1: Lluis Alseda
-
Objectives:
This course is an introduction to Combinatorial Optimisation at the first-year graduate level. We will also cover and review some important aspects of Linear and Integer Optimisation at the start
-
Topics:
Linear Optimisation, Integer Optimisation, Graph and Network Optimisation, Complexity Theory and Heuristics
-
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.