Volgenau School of Engineering
George Mason University
George Mason University Mason
George Mason University

OR 642: Integer Programming

Instructor Information

Section Information

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.

Course Information from University Catalog

Not Repeatable


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

Credits: 3

Prerequisites:

OR 541, or permission of instructor.

Instructor Information