2011-2012 University Catalog 
  
  Catalog Home
  About George Mason University
  Admission
  Tuition, Expenses, and Financial Aid
  School of Law
  Academic Policies
  Student Rights and Responsibilities
  General Policies
  Schedule of Classes
  University Academic Programs and Resources
  Transcript Key
  University General Education
  School for Conflict Analysis and Resolution
  College of Education and Human Development
  College of Health and Human Services
  College of Humanities and Social Sciences
  Krasnow Institute for Advanced Study
  School of Management
  School of Public Policy
  College of Science
  College of Visual and Performing Arts
  Volgenau School of Engineering
  Programs of Study
  Programs by Department
  Bachelor's/Accelerated Master's Programs
  Courses
  Administration and Faculty
HELP
2011-2012 University Catalog

OR 642 - Integer Programming

Credits: 3 (NR)
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.

Prerequisite(s): OR 541, or permission of instructor.

Hours of Lecture or Seminar per week: 3
Hours of Lab or Studio per week: 0