IEOR 6614, Spring 2009 : Homework 8

Assigned: Thursday, April 2, 2009
Due: Thursday, April 16, 2009

General Instructions

  1. Please review the course information.
  2. 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.
  3. Numbered problems are all from the textbook Network Flows .


  1. Problem 9.30. Transforming a minimum cost flow problem.
  2. Problem 10.14. Critical arcs.
  3. Problem 10.20. Capacity adjacent minimum cost flows.
  4. Problem 9.18. Cycle cancelling example.
  5. Problem 9.20. Shortest augmenting path example (you don't need to do the primal-dual algorithm part).
  6. Problem 10.22. Bit scaling of capacities.

Switch to: