Optimization Using Flow Networks in NetworkX

Explore optimization techniques using flow networks in NetworkX through this 22-minute EuroPython Conference talk. Gain an introduction to the NetworkX library and learn how to apply it for network flow optimization. Discover the origins of the max-flow min-cut problem and its applications. Follow along as the speaker demonstrates how to model and solve the project selection problem using NetworkX, including graph representation, proof of correctness, and finding solutions. Suitable for those with basic programming knowledge, this talk covers creating graphs, utilizing NetworkX methods and algorithms, and integrating with other libraries like Pandas.

Introduction
Flow Network
Application of Flow Network
Project Selection Problem
Solution
Edges
Cut
Example