COMBINATORIAL OPTIMIZATION

Course Description: 

Basic concepts and theorems are presented. Some significant applications are analyzed to illustrate the power and the use of combinatorial optimization. Special attention is paid to algorithmic questions.

The goals of the course:

One of the main goals of the course is to introduce students to the most important results of combinatorial optimization. A further goal is to discuss the applications of these results to particular problems, including problems involving applications in other areas of mathematics and practice.  Finally, computer science related problems are to be considered too.

Learning Outcomes: 

By the end of the course, students are enabled to do independent study and research in fields touching on the topics of the course, and how to use these methods to solve specific problems. In addition, they develop some special expertise in the topics covered, which they can use efficiently in other mathematical fields, and in applications, as well. They also learn how the topic of the course is interconnected to various other fields in mathematics, and in science, in general. They will learn how to use these tools in solving everyday life problems as well as in software developing.

Assessment: 
  • regular homework, and presentation or final