This course includes: hard combinatorial optimization problems, approximation algorithms, worst-case analysis, probabilistic analysis, domination analysis, E-approximation schemes and fully polynomial approximation schemes, metaheuristics and experimental analysis of algorithms. |