Regular version of the site

Academic Supervisor

Nikita Kuzmin

Scientific Supervisor

Valery A. Kalyagin

Manager

Yulia Nikolaeva

Contacts

136 Rodionova street, Room 408
Nizhny Novgorod, 603155, Russia

Phone: +7 (831) 432-01-05 *6404

Email: nmulihova@hse.ru

Feedback: Got ideas on how to make HSE University better? Share them here.

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!
To be used only for spelling or punctuation mistakes.

Delivered at:: Department of Applied Mathematics and Informatics (Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod))

Course type:: Compulsory course

When:: 1 year, 1, 2 module

Ask Question

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

Master’s Programme 'Data Mining'

Contacts

Discrete optimization and operations research

Course Syllabus

Abstract