IEOR 6605, Fall 2001: Homework 08

General Instructions

1. You must write down with whom you worked on the assignment. If this changes from problem to problem, then you should write down this information separately with each problem.
2. Please do not express an algorithm using only pseudocode. Additional explanation is required!
3. Numbered problems are all from the textbook Network Flows .

Problems

1. Problem 9.36. Min cost flow with uncapacitated arcs.
2. Problem 10.2. Capacity scaling algorithm.
3. Problem 10.14. Critical arcs.
4. Problem 10.20 and 10.22. Bit scaling of capacities.

   ---

   Switch to:

   • IEOR 6605, Fall 2001, Home Page
   • Homework 7
   • Homework 9

   ---

   cliff@ieor.columbia.edu