Mathematical optimization

Network flows and the problems that are easy

Integrality for free, total unimodularity, max-flow min-cut, and how fragile easiness is.

About 20 minutes7 activities Paper packet