Course Description: A survey of modeling techniques and solutions, algorithms, for integer programming (IP) problems, a class of optimization problems in which some or all of the variables are required to be integers. IP models are in widespread use today and include the most challenging (and least challenging) mathematical programming problems. Topics include IP model formulation, linear programming, cutting-plane algorithms, branch-and-bound techniques, and modern heuristic methods for these combinatorial problems.

Course Objectives: To present an overview of methods for creating and solving integer linear programs.

Course Outline by Topical Areas:

Constructing integer programming models

Linear programing review

Graphs and network problems with integer solutions

Cutting-plane methods

Enumeration methods (branch-and-bound, branch-and-cut, dynamic programming)

Heuristics for combinational optimization (greedy, Tabu search, genetic algorithms)

Commercial software

Complexity analysis

Course Requirements:

Homework: One every 2 weeks

Examinations: Two

Computer Facilities: Internet connection is helpful

Laboratory: None

Project: None

Degree Applicability:

CE[AA]	CH[NA]	CS[AA]	EE[BE]	EM[E]	ESM[NA]	MAT[NA]
MBA[NA]	ME[BDE]	MES[E]	MSE[DE]	SE[NA]	SY[AA]

Click here for further information on degree applicability.

NTU Semester Credit Hours: 3
Number of Lecture Hours: 30 (75 minute) lectures
Days Class Meets on Campus: Tuesday/Thursday

Contributing Scholar:
Dr. Richard S. Barr
School of Engineering and Applied Science
Southern Methodist University
Department EMIS
Science Information Center 356
Dallas, TX   75275-0112
Phone: 214-768-2605
          214-768-1100
Fax: 214-768-1112
barr@engr.smu.edu
http://faculty.smu.edu/barr/pom

Note: Contributing Scholars are responsible for the design, organization, content, and presentation of NTU courses. Online classroom management, student management, and other matters related to academic administration of courses are the responsibility of support "Faculty". Either person is often called "Instructor". To identify and differentiate between these roles, we use the terms "Contributing Scholar" and "Faculty".

Academic/Administrative Contact:  
Ms. Rose A Torres
Phone: 214-768-3037
Fax: 214-768-3778
rose@engr.smu.edu


Prerequisites: A course in operations research or a course in linear programming.

Textbooks: (Order Materials)

1.	Integer Programming, L. A. Wolsey, Wiley, New York, 1998, ISBN 0471283665.
2.	Integer Programming Class Notes, R. Barr, 2001 See course web page for ordering instructions. Recommended Textbook: Local Search in Combinatorial Optimzation, E. Aarts and J. Lenstra, eds., 1997, ISBN 0471948225;