IEOR 6614, Spring 2006 : Homework 8

Assigned: Thursday, March 30, 2006
Due: Wednesday, April 5, 2006

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 8.10. Preflow-push for unit capacity networks.
  2. Problem 9.8. Formulation of minimum-cost flow problems.
  3. Problem 9.14. Formulation of minimum-cost flow problems.
  4. Problem 9.18. Cycle cancelling algorithm. Note that this is the algorithm called "Klein's Algorithm" in class.
  5. Problem 9.36. Transformation of minimum-cost flow networks.
  6. Problem 9.42. Transforming a non-integral solution to an integral one.

Switch to: