Network problems: shortest path, spanning trees, flow problems, matching, routing. Complexity. Integer programming. Antirequisite(s): Prerequisite(s): One of: Mathematics 2156A/B, 3152A/B, the former Statistical Sciences 236, or permission of the Department. Corequisite(s): Pre-or Corequisite(s): Extra Information: 3 lecture hours, 0.5 course. back to top