You must be logged in to take this course → LOGIN | REGISTER NOW
The aim of this course is to describe the comprehensive introduction to the theory and algorithms. This course also covers 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. If you are interested about Integer Programming and Combinatorial Optimization, then this is the right one.
Assessment
This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer need to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.
Certification
Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.
Having an Official Edukite Certification is a great way to celebrate and share your success. You can:
- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success
Course Credit: MIT
Course Curriculum
| Module 01 | |||
| Formulations | 00:14:00 | ||
| Complexity | 00:14:00 | ||
| Methods to enhance formulations I | 00:14:00 | ||
| Methods to enhance formulations II | 00:13:00 | ||
| Ideal formulations I | 00:14:00 | ||
| Ideal formulations II | 00:13:00 | ||
| Ideal formulations III | 00:15:00 | ||
| Duality theory I | 00:14:00 | ||
| Duality theory II | 00:13:00 | ||
| Algorithms for solving relaxations | 00:12:00 | ||
| Robust discrete optimization | 00:13:00 | ||
| Lattices I | 00:14:00 | ||
| Lattices II | 00:16:00 | ||
| Module 02 | |||
| Algebraic geometry I | 00:14:00 | ||
| Algebraic geometry II | 00:12:00 | ||
| Geometry007 | 00:12:00 | ||
| Cutting plane methods I | 00:14:00 | ||
| Cutting plane methods II | 00:13:00 | ||
| Enumerative methods | 00:15:00 | ||
| Heuristic methods | 00:13:00 | ||
| Approximation algorithsm I | 00:13:00 | ||
| Approximation algorithms II | 00:15:00 | ||
| Approximation algorithms III | 00:12:00 | ||
| Mixed integer optimization I | 00:15:00 | ||
| Mixed integer optimization II | 00:14:00 | ||
| Assessment | |||
| Submit Your Assignment | 00:00:00 | ||
| Certification | 00:00:00 | ||
Course Reviews
No Reviews found for this course.
