MAT 258B Discrete Optimization (Matthias Köppe; Fall 2021)
MAT 258B Discrete Optimization (Matthias Köppe; Fall 2021)
This is a quarter-long Ph.D.-level course on Discrete and Mixed-Integer Optimization, held in Fall 2021. All videos are lightly edited versions of synchronously held lectures. All notes were written in real time.
Videos and all other materials are copyright 2021 Matthias Köppe and shared as Open Educational Resources subject to the Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) license.
Videos and all other materials are copyright 2021 Matthias Köppe and shared as Open Educational Resources subject to the Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) license.
-
2021-09-29: LP duality,…
-
2021-10-01: Representation and projection of…
-
2021-10-04: Representation of polyhedra, poset of…
-
2021-10-13: Stable set: Polyhedral combinatorics
-
2021-10-11: Stable set: Integer programming…
-
2021-10-08: Hilbert bases of cones, integer…
-
2021-10-15: Lifting valid inequalities
-
2021-10-06: Generating sets for cones and affine…
-
2021-10-20: Network flows, shortest paths,…
-
2021-10-22: Dynamic programming, bin packing…
-
2021-10-25: Facility location, mixed integer…
-
2021-10-27: Disjunctive, logic modeling,…
-
2021-10-29: Optimization via separation,…
-
2021-11-01: Separation of cutset inequalities
-
2021-11-03: Knapsack: Lifted cover inequalities
Search for ""