6.854J | Fall 2005 | Graduate

Advanced Algorithms

Lecture Notes

lec14_1999.pdf

Description:

This resource contains information on shortest augmenting paths, finding a minimum cost circulation, and minimum cost flow in general networks by cost scaling.

Resource Type:
Lecture Notes

Course Info

Fall 2005
Problem Set Solutions
Problem Sets