optimization
Network flow as a linear program
taught
Taught in
-
Shortest path, revisited
Optimization
-
Max flow and min cut, revisited
Optimization
Requires
- lp-standard-and-canonical-form required
- max-flow-min-cut required
Required by
- The transportation problem required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.