1. Formulations

2. Optimality, Relaxation, and Bounds

3. Well-Solveds: Greedy and Local Search

4. Matchings and Assignments

5. Dynamics Programming

6. Complexity and Problem Reduction

7. Branch and Bound

8. Cutting Plane Algorithms

9. Strong Valid Inequalities

10. Lagrangian Duality

11. Column Generation Algorithms

12. Heuristic Algorithms

13. From Theory to Solutions