About this Course

75,786 recent views

Learner Career Outcomes

33%

started a new career after completing these courses

21%

got a tangible career benefit from this course
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. 65 hours to complete
English

Skills you will gain

Constraint ProgrammingBranch And BoundDiscrete OptimizationLinear Programming (LP)

Learner Career Outcomes

33%

started a new career after completing these courses

21%

got a tangible career benefit from this course
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. 65 hours to complete
English

Offered by

Placeholder

The University of Melbourne

Syllabus - What you will learn from this course

Content RatingThumbs Up95%(3,513 ratings)Info
Week
1

Week 1

2 hours to complete

Welcome

2 hours to complete
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

Week 2

7 hours to complete

Knapsack

7 hours to complete
9 videos (Total 101 min)
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

Week 3

17 hours to complete

Constraint Programming

17 hours to complete
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

Week 4

13 hours to complete

Local Search

13 hours to complete
10 videos (Total 191 min)
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

Reviews

TOP REVIEWS FROM DISCRETE OPTIMIZATION

View all reviews

Frequently Asked Questions

More questions? Visit the Learner Help Center.