Video

Unknown · 0:00

This lecture continues a course on convex optimization/combinatorics, using the perfect matching polytope of a graph as the central worked example to motivate why linear programming alone doesn't solve combinatorial o...

Read the full summary on tuber