Creating Integer Programming Models

• IP models in practice:
• Model categories
• Formulating IP and MIP models
• Real-world case studies

Integer Programming Algorithms

• Review of linear programming 
• Cutting-plane methods
• Branch-and-bound, branch-and-cut methods
• Heuristics and metaheuristics: greedy, GRASP, genetic algorithms, tabu search

The class is offered on the campus of Southern Methodist University, Dallas, Texas, and is also available: • live on the Dallas-Fort- Worth-area TAGER network and National Technological University satellite broadcast, and • by videotape from NTU and the SMU School of Engineering and Applied Science.

Examinations: Two exams, no comprehensive final

Homework assignments given. No computer programming will be required.

Texts:

• (Required) L. Wolsey, Integer Programming, John Wiley, 1998, ISBN 0-471-28366-5
• (Required) R. Barr, Integer Programming Class Notes
• (Recommended) E. Aarts and J. Lenstra, eds., Local Search in Combinatorial Optimization, Wiley, 1997, ISBN 0-471-94822-5