Chapter1  Optimization Problems
Chapter2  The Simplex Algorithm
Chapter3  Duality
Chapter4  Computational Considerations for simplex Algorithm
Chapter5  The Primal-Dual Algorithm
Chapter6  Primal-Dual Algorithms for max-flow and shorest path:Ford-Fulkerson and Dijkstra
Chapter7  Primal-Dual Algorithms min-cost flow
Chapter8  Algorithms and Complexity
Chapter9  Efficient Algorithms for the max-flow Problem
Chapter10 Algorithms for Maching
Chapter11 Weighted Matching
Chapter12 Spanning Trees and Matroids
Chapter13 Integer Linear Programming
Chapter14 A Cutting-Plane Algorithm for Integer Linear Programs
Chapter15 NP-Complete Problems
Chapter16 More About NP-Completeness
Chapter17 Approximation Algorithm
Chapter18 Branch and Bound and Dynamic Programming
Chapter19 Local Search