Assigned:
Thursday, April 5, 2012
Due:
Thursday, April 12, 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
- 9.36 Negative arcs with infinite capacities.
- 9.54 Capacitated minimum spanning tree problem.
- 10.1. Example of capacity scaling algorithm.
- 10.2. Modification of capacity scaling algorithm.
- 10.22. Bit scaling of capacities.
Switch to:
[email protected]