INDENG 266: Network Flows and Graphs
Semester Offered: 
Fall
Units: 
3.00

Survey of solution techniques and problems that have formulations in terms of flows in networks. Max-flow min-cut theorem. Minimum cost flows. Multiterminal and multicommodity flows. Relationship with linear programming, transportation problems, electrical networks and critical path scheduling.