IEOR 6614, Spring 2009 : Homework

Assigned: Thursday, April 23, 2009
Due: (Optional) Thursday, April 30, 2009

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. 12.34, 12.35. Running the non-bipartite matching algorithm.
  2. 12.36. A quandry.
  3. 12.38. Matchable nodes.
  4. 12.42 Unmatchable edges.


Switch to:


cliff@ieor.columbia.edu