Elective List

This course focuses on the design and analysis of combinatorial optimization algorithmsç Computational complexityö P and NP problem classes, NP-Completeness, neighborhood, local and global optimality, and analysis of algorithms are among topics that are covered. In addition to exact algorithms developed for problems that can be solved in polynomial time, the course also introduces local search algorithms and metaheuristic approaches for NP-complete problems.