Formulation, Theory and Algorithmic aspects of Integer Programming are discussed. We study how to formulate the real problems as integer programming models and discuss computational complexity, the description of the convex hull of feasible solutions. For computational methods, we study branch-and-bound, Lagrangian relaxation, strong cutting-plane method, etc. (Prerequisite: IE531 Linear Programming or permission of the Instructor).