|
Southern Methodist University Course: CSE 8373, NTU Course QM 730-N
Spring, 2001, TTh, 2:00-3:20 p.m. (Central) Caruth Hall
The course surveys modeling techniques and solution algorithms for integer programming (IP) problems, a class of optimization problems in which some or all of the variables are required to be
integer-valued. IP models are in widespread use today and include some of 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 (meta-)heuristic methods for these combinatorial problems.
|
