2024/2025

Discrete optimization and operations research

Type: Mago-Lego

Delivered by: Department of Applied Mathematics and Informatics

When: 1, 2 module

Open to: students of all HSE University campuses

Instructors: Ekaterina K. Batsyna

Language: English

ECTS credits: 6

Contact hours: 56

Course Syllabus

Abstract

The course covers modern exact methods for solving combinatorial optimization problems, including methods of branches and bounds, branches and clippings, branches and prices. All algorithms are analyzed on the example of well-known optimization problems, such as the maximum clique problem, the traveling salesman problem, transport routing problems, and so on