Assigned:
Thursday, March 29, 2012
Due:
Thursday, April 5, 2012
General Instructions
- Please review the
course information.
- 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.
- Numbered problems are all from the textbook Network Flows .
Problems
- Problem 9.8. Formulation of minimum-cost flow problems.
- Problem 9.36. Transformation of minimum-cost flow networks.
- Problem 9.42. Do more than suggest. Give and prove.
- Problem 9.18, 9.19. Cycle cancelling example.
- Problem 10.20, 10.21. Capacity adjacent minimum cost flow and cost adjacent minimum cost flow.
- It is not clear that the analysis of the minimum-mean cycle-cancellin
algorithm is tight.
Give an example of a graph (or family of graphs) for which the minimum-mean cycle-cancelling algorithm takes
as many iterations as possible.
Switch to:
[email protected]