OR 642: Integer Programming
Course Information from University Catalog
Cutting plane and enumeration algorithms for solution of integer linear programs; bounding strategies and reformulation techniques; heuristic approaches to the solution of complex problems; knapsack problems, matching problems, set covering and partitioning problems; applications to problems in OR/MS, such as capital budgeting, facility location, political redistricting, engineering design, and scheduling.
Hours of Lecture or Seminar per week: 3
OR 541, or permission of instructor.
1 Course Sections Scheduled for Spring 2018
OR 642 - 001: |
M; 4:30 pm - 7:10 pm