Discrete Optimization by Coursera
Skills you will learn!
Curriculum
7 Topics
Course Promo
Course Motivation - Indiana Jones challenges applications
Course Introduction - philosophy design grading rubric
Assignments Introduction & Any Integer
Start of Course Survey
Course Syllabus
Any Integer
10 Topics
Knapsack 1 - intuition
Knapsack 2 - greedy algorithms
Knapsack 3 - modeling
Knapsack 4 - dynamic programming
Knapsack 5 - relaxation branch and bound
Knapsack 6 - search strategies depth first best first least discrepancy
Assignments Getting Started
Knapsack & External Solver
Exploring the Material - open course design optimization landscape picking your adventure
Knapsack
16 Topics
CP 1 - intuition computational paradigm map coloring n-queens
CP 2 - propagation arithmetic constraints send+more=money
CP 3 - reification element constraint magic series stable marriage
CP 4 - global constraint intuition table constraint sudoku
CP 5 - symmetry breaking BIBD scene allocation
CP 6 - redundant constraints magic series market split
CP 7 - car sequencing dual modeling
CP 8 - global constraints in detail knapsack alldifferent
CP 9 - search first-fail euler knight ESDD
CP 10 - value/variable labeling domain splitting symmetry breaking in search
Graph Coloring
Optimization Tools
Set Cover
Optimization Tools
Graph Coloring
Set Cover
11 Topics
LS 1 - intuition n-queens
LS 2 - swap neighborhood car sequencing magic square
LS 3 - optimization warehouse location traveling salesman 2-opt k-opt
LS 4 - optimality vs feasibility graph coloring
LS 5 - complex neighborhoods sports scheduling
LS 6 - escaping local minima connectivity
LS 7 - formalization heuristics meta-heuristics introduction
LS 8 - iterated location search metropolis heuristic simulated annealing tabu search intuition
LS 9 - tabu search formalized aspiration car sequencing n-queens
Traveling Salesman
Traveling Salesman
6 Topics
LP 1 - intuition convexity geometric view
LP 2 - algebraic view naive algorithm
LP 3 - the simplex algorithm
LP 4 - matrix notation the tableau
LP 5 - duality derivation
LP 6 - duality interpretation and uses
7 Topics
MIP 1 - intuition relaxation branch and bound knapsack warehouse location
MIP 2 - modeling big-M warehouse location graph coloring
MIP 3 - cutting planes Gomory cuts
MIP 4 - convex hull polyhedral cuts warehouse location node packing graph coloring
MIP 5 - cover cuts branch and cut seven bridges traveling salesman
Facility Location
Facility Location
3 Topics
Scheduling - jobshop disjunctive global constraint
Vehicle Routing
Vehicle Routing
3 Topics
Large Neighborhood Search - asymmetric TSP with time windows
Column Generation - branch and price cutting stock
End of course survey
Discrete Optimization
Thank You!
Your review has been submitted successfully.