logo-polimi
Loading...
Degree programme
Programme Structure
Show/Search Programme
Course Details
Save Document
Degree Programme
Read Degree Programme
Quantitative data
Faculty
Infrastructures
International context
Customized Schedule
Your customized time schedule has been disabled
Enable
Search
Search a Professor
Search a Course
Search a Course (system prior D.M. n. 509)
Search Lessons taught in English

Glossary
Semester (Sem)
1First Semester
2Second Semester
AAnnual course
Educational activities
CSimilar or integrative activities
Language
Course completely offered in italian
Course completely offered in english
--Not available
Innovative teaching
The credits shown next to this symbol indicate the part of the course CFUs provided with Innovative teaching.
These CFUs include:
  • Subject taught jointly with companies or organizations
  • Blended Learning & Flipped Classroom
  • Massive Open Online Courses (MOOC)
  • Soft Skills
Course Details
Context
Academic Year 2019/2020
School School of Industrial and Information Engineering
Name (Master of Science degree)(ord. 270) - MI (481) Computer Science and Engineering
Track T2A - COMPUTER SCIENCE AND ENGINEERING
Programme Year 2

Course Details
ID Code 051823
Course Title DISCRETE OPTIMIZATION
Course Type Mono-Disciplinary Course
Credits (CFU / ECTS) 5.0
Semester Second Semester
Course Description "The aim of the course is to present some of the main concepts and methods of Discrete Optimization which allow to tackle a wide variety of decision-making problems arising in science, engineering and management. The focus is on Integer Linear Programming (ILP), that is, on optimization problems with a linear objective function and linear constraints where some (or all) variables are restricted to take discrete (integer) values. Modeling and application-related aspects are also covered. Topics: Fundamentals of convex analysis. ILP problems and modeling techniques. Alternative, strong and ideal formulations. ""Easy"" ILP problems. Lagrangian, surrogate, combinatorial relaxations. Heuristics (greedy and local search). Branching strategies for the Branch-and-Bound method. Cutting plane methods: cuts for generic ILP problems, strong valid inequalities for structured ILP problems, separation and lifting. Branch-and-Cut method. Column generation method. During the computer laboratory sessions, the students will learn how to solve (mixed) integer linear optimization problems using AMPL modeling language and a state-of-the-art solver."
Scientific-Disciplinary Sector (SSD)
Educational activities SSD Code SSD Description CFU
C
MAT/09
OPERATIONS RESEARCH
5.0

Schedule, add and removeAlphabetical groupProfessorLanguageCourse details
From (included)To (excluded)
--AZZZZAmaldi Edoardo
manifesti v. 3.4.30 / 3.4.30
Area Servizi ICT
29/09/2022