15.082J | Fall 2010 | Graduate

Network Optimization

Lecture Notes

MIT15_082JF10_lec14.ppt

Description:

This resource contains information for minimum cost flow: polynomial time algorithms.

Resource Type:
Lecture Notes
file
876 kB
MIT15_082JF10_lec14.ppt
Download File
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2024 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2024 Massachusetts Institute of Technology