About this Course

7,994 recent views

Learner Career Outcomes

50%

got a tangible career benefit from this course

50%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 22 hours to complete
English

Learner Career Outcomes

50%

got a tangible career benefit from this course

50%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 22 hours to complete
English

Offered by

Placeholder

The University of Melbourne

Placeholder

The Chinese University of Hong Kong

Syllabus - What you will learn from this course

Week
1

Week 1

6 hours to complete

Basic Constraint Programming

6 hours to complete
8 videos (Total 128 min), 3 readings, 1 quiz
8 videos
3.1.1 Constraint Programming Solvers13m
3.1.2 Domains + Propagators18m
3.1.3 Bounds Propagation21m
3.1.4 Propagation Engine21m
3.1.5 Search25m
3.1.6 Module 1 Summary4m
Workshop 919m
3 readings
Course Overview10m
Start of Course Survey10m
Workshop 9: CP Basic Search Strategies10m
Week
2

Week 2

6 hours to complete

Advanced Constraint Programming

6 hours to complete
7 videos (Total 143 min), 1 reading, 1 quiz
7 videos
3.2.2 Restart and Advanced Search20m
3.2.3 Inside Alldifferent14m
3.2.4 Inside Cumulative14m
3.2.5 Flattening39m
3.2.6 Module 2 Summary6m
Workshop 1030m
1 reading
Workshop 10: CP Advanced Search Strategies10m
Week
3

Week 3

5 hours to complete

Mixed Integer Programming

5 hours to complete
6 videos (Total 102 min), 1 reading, 1 quiz
6 videos
3.3.2 Mixed Integer Programming17m
3.3.3 Cutting Planes14m
3.3.4 MiniZinc to MIP13m
3.3.5 Module 3 Summary4m
Workshop 1126m
1 reading
Workshop 11: MIP Modelling10m
Week
4

Week 4

6 hours to complete

Local Search

6 hours to complete
10 videos (Total 160 min), 2 readings, 1 quiz
10 videos
3.4.2 Constraints and Local Search12m
3.4.3 Escaping Local Minima- Restart6m
3.4.4 Simulated Annealing7m
3.4.5 Tabu List9m
3.4.6 Discrete Langrange Multiplier Methods28m
3.4.7 Large Neighbourhood Search24m
3.4.8 MiniZinc to Local Search16m
3.4.9 Module 4 Summary8m
Workshop 1230m
2 readings
Workshop 12: Local Search10m
End of Course Survey10m

Reviews

TOP REVIEWS FROM SOLVING ALGORITHMS FOR DISCRETE OPTIMIZATION

View all reviews

Frequently Asked Questions

More questions? Visit the Learner Help Center.