IEOR 6614, Spring 2009 : Homework 1

Assigned: Thursday, January 22, 2009
Due: Thursday, January 29, 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. List your previous degrees.
    2. Have you had a course in data structures and/or algorithms? If so, briefly describe the course.
    3. Have you had a course in linear programming? If so, briefly describe the course.
    4. Have you had a courses combinatorics, graph theory, and/or discrete mathematics? If so, briefly describe the course.
    5. Describe your computer programming experience.
  2. Problem 2.20. Cycles in graphs.
  3. Problem 3.4. Function ranking.
  4. Problem 3.26. Mazes.
  5. Problem 13.30. Most vital arc.
  6. Prove that in a graph in which all edge weights are distinct, the minimum spanning tree is unique.

    Switch to:

    cliff@ieor.columbia.edu