0
(
ratings
)
1
students
Created by:
Last updated:
September 20, 2022
Duration:
Unlimited Duration
FREE
This course includes:
Unlimited Duration
Badge on Completion
Certificate of completion
Unlimited Duration
Description
The course is a comprehensive introduction to the theory
algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.
Course Curriculum
- Formulations Unlimited
- Complexity Unlimited
- Methods to enhance formulations I Unlimited
- Methods to enhance formulations II Unlimited
- Ideal formulations I Unlimited
- Ideal formulations II Unlimited
- Ideal formulations III Unlimited
- Duality theory I Unlimited
- Duality theory II Unlimited
- Algorithms for solving relaxations Unlimited
- Robust discrete optimization Unlimited
- Lattices I Unlimited
- Lattices II Unlimited
- Algebraic geometry I Unlimited
- Algebraic geometry II Unlimited
- Geometry Unlimited
- Cutting plane methods I Unlimited
- Cutting plane methods II Unlimited
- Enumerative methods Unlimited
- Heuristic methods Unlimited
- Approximation algorithsm I Unlimited
- Approximation algorithms II Unlimited
- Approximation algorithms III Unlimited
- Mixed integer optimization I Unlimited
- Mixed integer optimization II Unlimited
About the instructor
5
5
Instructor Rating
1
Reviews
1520
Courses
1916
Students
Massachusetts Institute of Technology
