About this Course
139,357 recent views

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Intermediate Level

Approx. 33 hours to complete

Suggested: 8 weeks of study, 10-15 hours per week...

English

Subtitles: English

Skills you will gain

Constraint ProgrammingBranch And BoundDiscrete OptimizationLinear Programming (LP)

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Intermediate Level

Approx. 33 hours to complete

Suggested: 8 weeks of study, 10-15 hours per week...

English

Subtitles: English

Syllabus - What you will learn from this course

Week
1
2 hours to complete

Welcome

4 videos (Total 43 min), 3 readings, 1 quiz
4 videos
Course Motivation - Indiana Jones, challenges, applications20m
Course Introduction - philosophy, design, grading rubric11m
Assignments Introduction & Any Integer9m
3 readings
Start of Course Survey10m
Socialize10m
Course Syllabus10m
Week
2
7 hours to complete

Knapsack

9 videos (Total 101 min), 1 quiz
9 videos
Knapsack 2 - greedy algorithms7m
Knapsack 3 - modeling8m
Knapsack 4 - dynamic programming17m
Knapsack 5 - relaxation, branch and bound14m
Knapsack 6 - search strategies, depth first, best first, least discrepancy14m
Assignments Getting Started13m
Knapsack & External Solver10m
Exploring the Material - open course design, optimization landscape, picking your adventure10m
Week
3
17 hours to complete

Constraint Programming

13 videos (Total 248 min), 1 reading, 2 quizzes
13 videos
CP 2 - propagation, arithmetic constraints, send+more=money26m
CP 3 - reification, element constraint, magic series, stable marriage16m
CP 4 - global constraint intuition, table constraint, sudoku19m
CP 5 - symmetry breaking, BIBD, scene allocation18m
CP 6 - redundant constraints, magic series, market split11m
CP 7 - car sequencing, dual modeling18m
CP 8 - global constraints in detail, knapsack, alldifferent33m
CP 9 - search, first-fail, euler knight, ESDD25m
CP 10 - value/variable labeling, domain splitting, symmetry breaking in search28m
Graph Coloring6m
Optimization Tools5m
Set Cover8m
1 reading
Optimization Tools10m
Week
4
13 hours to complete

Local Search

10 videos (Total 191 min), 1 quiz
10 videos
LS 2 - swap neighborhood, car sequencing, magic square15m
LS 3 - optimization, warehouse location, traveling salesman, 2-opt, k-opt23m
LS 4 - optimality vs feasibility, graph coloring22m
LS 5 - complex neighborhoods, sports scheduling21m
LS 6 - escaping local minima, connectivity15m
LS 7 - formalization, heuristics, meta-heuristics introduction22m
LS 8 - iterated location search, metropolis heuristic, simulated annealing, tabu search intuition18m
LS 9 - tabu search formalized, aspiration, car sequencing, n-queens26m
Traveling Salesman10m
4.9
76 ReviewsChevron Right

40%

started a new career after completing these courses

40%

got a tangible career benefit from this course

17%

got a pay increase or promotion

Top reviews from Discrete Optimization

By SKMay 30th 2019

Exceptional coverage of optimization fundamentals. Learning of practical applied methods. Real university level course, no water down "data science". Absolutely love it! Thank you professor Pascal.

By AMFeb 6th 2017

I like the instructor teaching approach and the evaluation system, the subject itself took me a lot of effort and i think the LNS technique should be teached just after local search.

Instructors

Avatar

Dr. Carleton Coffrin

Adjunct Lecturer
Computing and Information Systems

About The University of Melbourne

The University of Melbourne is an internationally recognised research intensive University with a strong tradition of excellence in teaching, research, and community engagement. Established in 1853, it is Australia's second oldest University....

Frequently Asked Questions

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

  • 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.

  • Good programming skills, knowledge of algorithms and linear algebra.

  • 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.

  • A motivated student spending the time on the programming assignment will succeed in this class.

  • At the discrete optimization store: http://www.zazzle.com.au/discreteoptimization

More questions? Visit the Learner Help Center.