Integer Linear Programming: Basics, Branch-and-Bound, Cutting Plane Methods. Combinatorial Optimization: Basics of approximation algorithms. Network flow problems. Interior point methods. 2 Aug 24 ...

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.

Marshall, Paul W. "Linear Programming: A Technique for Analyzing Resource Allocation Problems." Harvard Business School Background Note 171-322, January 1971. (Revised November 1975.) ...