IEOR 6605, Fall 2001: Homework 11

Assigned: Friday, November 30, 2001
Due: Thursday, December 6, 2001

General Instructions

  1. 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.
  2. Please do not express an algorithm using only pseudocode. Additional explanation is required!
  3. Numbered problems are all from the textbook Network Flows .

Problems

  1. Problem 12.34, 12.36. Matching algorthm.
  2. Problem 12.42. Unmatchable nodes
  3. Problem 12.44. Matching on a tree.
  4. Problem 17.22. 2-commodity flows.
  5. Problem 17.26. Concurrent flow problem.
  6. Problem 17.28. More on the concurrent flow problem.


    Switch to:


    cliff@ieor.columbia.edu