We use cookies in order to improve the quality and usability of the HSE website. More information about the use of cookies is available here, and the regulations on processing personal data can be found here. By continuing to use the site, you hereby confirm that you have been informed of the use of cookies by the HSE website and agree with our rules for processing personal data. You may disable cookies in your browser settings.

✖
  • A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
For visually-impairedFor visually-impairedUser profile (HSE staff only)SearchMenu
HSE University
User profile (HSE staff only)Search
Advanced search

Course Syllabus

Course Syllabus


 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Postgraduate course 2022/2023

Discrete Optimization

Type: Elective course
Area of studies: Informatics and Computer Engineering
Delivered by: School of Data Analysis and Artificial Intelligence
Where: Faculty of Computer Science
When: 2 year, 1 semester
Mode of studies: offline
Open to: students of one campus
Instructors: Тhomas Clement Fernique
Language: English
ECTS credits: 8
Contact hours: 38

Course Syllabus

Ask Question

Abstract

This course aims to present methods commonly used when it comes to optimize a function on some discrete space. After a brief introduction, we shall approach the Linear Programming as a all-around tool to model a wide set of problems. We also focus on Dynamic Programming as a technique for designing efficient algorithms. Integer Programming revolves around specific techniques when Linear Program require integrality of variables. Finally we'll consider some usual heuristics when nothing works.