IEOR 6605, Fall 2001: Homework 09

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 11.12. Spanning tree solutions.
2. Problem 11.16. Network simplex example.
3. Problem 11.24. Network simplex.
4. Problem 11.42. Determinants of spanning trees.

   ---

   Switch to:

   • IEOR 6605, Fall 2001, Home Page
   • Homework 8
   • Homework 10

   ---

   cliff@ieor.columbia.edu