IEOR 6614, Spring 2007 : Homework 8

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 .

Problems

1. Problem 7.22. Variations of push/relabel algorithms
2. Problem 9.8. Formulation of minimum-cost flow problems.
3. Problem 9.14. Formulation of minimum-cost flow problems.
4. Problem 9.36. Transformation of minimum-cost flow networks.

Switch to:

• Homework 7
• Homework 9