At the end of the course, the students will be able to

1. understand principles of conventional heuristic search algorithms for solving combinatorial optimization problems.

2. understand, develop, and implement metaheuristic search algorithms for solving combinatorial optimization problems.

3. comprehend computational complexity of heuristic search algorithms and evaluate their performance empirically.