Assigned:
Thursday, February 13, 2014
Due:
Thursday, February 20, 2014
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 5.50. Minimum mean cycle example.
- Give an O(nm) time algorithm that actually outputs the minimum mean cycle of a graph.
- Problem 6.2. Nurse Staff Scheduling.
- Problem 6.32. Airline Scheduling.
- Problem 6.4. Solving a system of equations as a maximum flow problem.
Switch to:
[email protected]