About this Course

36,584 recent views

Tired of solving Sudokus by hand? This class teaches you how to solve complex search problems with discrete optimization concepts and algorithms, including constraint programming, local search, and mixed-integer programming.
Optimization technology is ubiquitous in our society. It schedules planes and their crews, coordinates the production of steel, and organizes the transportation of iron ore from the mines to the ports. Optimization clears the day-ahead and real-time markets to deliver electricity to millions of people. It organizes kidney exchanges and cancer treatments and helps scientists understand the fundamental fabric of life, control complex chemical reactions, and design drugs that may benefit billions of individuals.

This class is an introduction to discrete optimization and exposes students to some of the most fundamental concepts and algorithms in the field. It covers constraint programming, local search, and mixed-integer programming from their foundations to their applications for complex practical problems in areas such as scheduling, vehicle routing, supply-chain optimization, and resource allocation.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Intermediate Level

Approx. 65 hours to complete

English

Could your company benefit from training employees on in-demand skills?

Try Coursera for Business

Skills you will gain

Constraint Programming
Branch And Bound
Discrete Optimization
Linear Programming (LP)

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Intermediate Level

Approx. 65 hours to complete

English

Could your company benefit from training employees on in-demand skills?

Try Coursera for Business

Instructors

Instructor rating

4.79/5 (140 Ratings)

Professor Pascal Van Hentenryck

64,339 Learners

1 Course

Dr. Carleton Coffrin

Adjunct Lecturer

Computing and Information Systems

66,148 Learners

2 Courses

Syllabus - What you will learn from this course

Content Rating95%(4,319 ratings)

Week1

Week 1

2 hours to complete

Welcome

2 hours to complete

4 videos (Total 43 min), 2 readings, 1 quiz

Week2

Week 2

7 hours to complete

Knapsack

These lectures introduce optimization problems and some optimization techniques through the knapsack problem, one of the most well-known problem in the field. It discusses how to formalize and model optimization problems using knapsack as an example. It then reviews how to apply dynamic programming and branch and bound to the knapsack problem, providing intuition behind these two fundamental optimization techniques. The concept of relaxation and search are also discussed.

7 hours to complete

9 videos (Total 101 min)

Week3

Week 3

17 hours to complete

Constraint Programming

Constraint programming is an optimization technique that emerged from the field of artificial intelligence. It is characterized by two key ideas: To express the optimization problem at a high level to reveal its structure and to use constraints to reduce the search space by removing, from the variable domains, values that cannot appear in solutions. These lectures cover constraint programming in detail, describing the language of constraint programming, its underlying computational paradigm and how it can be applied in practice.

17 hours to complete

13 videos (Total 248 min), 1 reading, 2 quizzes

13 videos

CP 1 - intuition, computational paradigm, map coloring, n-queens27mCP 2 - propagation, arithmetic constraints, send+more=money26mCP 3 - reification, element constraint, magic series, stable marriage16mCP 4 - global constraint intuition, table constraint, sudoku19mCP 5 - symmetry breaking, BIBD, scene allocation18mCP 6 - redundant constraints, magic series, market split11mCP 7 - car sequencing, dual modeling18mCP 8 - global constraints in detail, knapsack, alldifferent33mCP 9 - search, first-fail, euler knight, ESDD25mCP 10 - value/variable labeling, domain splitting, symmetry breaking in search28mGraph Coloring6mOptimization Tools5mSet Cover8m

1 reading

Optimization Tools10m

Week4

Week 4

13 hours to complete

Local Search

Local search is probably the oldest and most intuitive optimization technique. It consists in starting from a solution and improving it by performing (typically) local perturbations (often called moves). Local search has evolved substantially in the last decades with a lot of attention being devoted on which moves to explore. These lectures explore the theory and practice of local search, from the concept of neighborhood and connectivity to meta-heuristics such as tabu search and simulated annealing.

13 hours to complete

10 videos (Total 191 min)

10 videos

LS 1 - intuition, n-queens13mLS 2 - swap neighborhood, car sequencing, magic square15mLS 3 - optimization, warehouse location, traveling salesman, 2-opt, k-opt23mLS 4 - optimality vs feasibility, graph coloring22mLS 5 - complex neighborhoods, sports scheduling21mLS 6 - escaping local minima, connectivity15mLS 7 - formalization, heuristics, meta-heuristics introduction22mLS 8 - iterated location search, metropolis heuristic, simulated annealing, tabu search intuition18mLS 9 - tabu search formalized, aspiration, car sequencing, n-queens26mTraveling Salesman10m

Week5

Week 5

2 hours to complete

Linear Programming

Linear programming has been, and remains, a workhorse of optimization. It consists in optimizing a linear objective subject to linear constraints, admits efficient algorithmic solutions, and is often an important building block for other optimization techniques. These lectures review fundamental concepts in linear programming, including the infamous simplex algorithm, simplex tableau, and duality. .

2 hours to complete

6 videos (Total 130 min)

Week6

Week 6

12 hours to complete

Mixed Integer Programming

Mixed Integer Programming generalizes linear programming by allowing integer variables, which dramatically changes the complexity of the problems but also broadens the potential applications significantly. These lectures review how to model problems in mixed-integer programming and how to solve mixed-integer programs using branch and bound. Advanced techniques such as cutting planes and polyhedral cuts are also covered.

12 hours to complete

6 videos (Total 136 min)

Week7

Week 7

11 hours to complete

Advanced Topics: Part I

11 hours to complete

2 videos (Total 51 min)

Week8

Week 8

1 hour to complete

Advanced Topics: Part II

1 hour to complete

2 videos (Total 32 min), 1 reading

Reviews

4.8

165 reviews

5 stars
88.99%
4 stars
8.18%
3 stars
1.12%
2 stars
0.14%
1 star
1.55%

TOP REVIEWS FROM DISCRETE OPTIMIZATION

by MHDec 13, 2020

Perfect delivery. Very smooth and nice. An adequate level of difficulty in assigments. The best online course I have passsed.

by GMApr 6, 2020

Well-defined course and interesting lecturer. He's highly engaging although the material of the course is pretty technical. Thanks a lot for making this course!!!!

by BTSep 15, 2020

This is an amazing course to really help students explore the variety of techniques that are available to solve extremely hard optimization problems.

by ADJun 5, 2019

Excellent course! The course video are very clear and build on each other as the course progress. It is well structured. The assignments have the right amount of difficulty.

View all reviews

Frequently Asked Questions

When will I have access to the lectures and assignments?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
What will I get if I purchase the Certificate?
When you purchase a Certificate you get access to all course materials, including graded assignments. Upon completing the course, your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
Is financial aid available?
Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.
• What are the pre-requisites for the class?
Good programming skills, knowledge of algorithms and linear algebra.
• What programming language will be used in this class?
A minimal knowledge of python is necessary to integrate with the course infrastructure. Outside of that, students are free to use any language of their choice.
• How difficult is this class?
A motivated student spending the time on the programming assignment will succeed in this class.
• Where can I get one of those T-Shirts?
At the discrete optimization store: http://www.zazzle.com.au/discreteoptimization

More questions? Visit the Learner Help Center.

Discrete Optimization