
Discrete Optimization (University of Victoria Math 428/529)
Live Last read · last published · next check
Latest videos
Saves to your Watch queue, to pick up on another day or another device.


Discrete Optimization Lecture 14: List Colouring

Discrete Optimization Lecture 13: Edge Colouring

Discrete Optimization Lecture 12: Graph Colouring, Perfect Graphs and the Stable Set Polytope

Discrete Optimization Lecture 11: Max-Flow and Ford–Fulkerson Algorithm

Discrete Optimization Lecture 10: Matching Polytope and Network Flows

Discrete Optimization Lecture 9: Stable Marriage Problem and Tutte–Berge Formula

Discrete Optimization Lecture 8: Weighted Matching and Perfect Matching Problems in Bipartite Graphs

Discrete Optimization Lecture 7: Introduction to Matchings, Kőnig's Theorem

Discrete Optimization Lecture 6: Strong Duality for Linear Programming

Discrete Optimization Lecture 5: Linear Programming Basics and Weak Duality

Discrete Optimization Lecture 4: Introduction to Linear Programming

Discrete Optimization Lecture 3: Reductions, hardness, NP-completeness, SAT, 3-SAT, undecidability

Discrete Optimization Lecture 2: Decision Problems, Complexity classes. Philosophy of Duality

