A polynomial time primal network simplex algorithm for minimum cost flows James B. Orlin Presented by Tal Kaminker
Reminder – minimum cost flow •
overview •
Non-degeneracy assumption •
notations •
The regular network simplex algorithm •
Potential - reminder •
rooted in-tree •
premultipliers •
premultipliers •
premultipliers •
premultipliers •
premultipliers network simplex algorithm •
modify-premultipliers •
Lemma: The premultiplier algorithm maintains a legal vector of premultipliers at every step. Proof: • simplex-pivot maintains a legal tree
Proof cont. •
Proof cont. •
premultipliers network simplex algorithm Lemma: Each call of modify-premultipliers strictly increases the number of eligible nodes. Theorem: The premultiplier algorithm is a special case of the network simplex algorithm. As such, it solves the minimum cost flow problem in a finite number iterations.
cost-scaling version of premultipliers alg. •
• cost-scaling algorithm
correctness Theorem: The algorithm stops after finite amount of iterations and at the end yields the optimal flow Proof: Almost the same as the regular premultiplier algorithm