1. Introduction and Linear Programming
2. Revised Simplex Algorithm
3. Simplex Method for Bounded Variables
4. One Dimensional Cutting Stock Problem (Part I)
5. One Dimensional Cutting Stock Problem (Part II)
6. Dantzig-Wolfe Decomposition Algorithm
7. Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm
8. Primal-Dual Algorithm
9. Goal Programming-Formulations
10. Goal Programming Solutions Complexity of Simplex Algorithm (Part I)
11. Complexity of Simplex Algorithm (Part II) and Integer Programming
12. Integer Programming-Formulations
13. Solving Zero-One Problems (Part I)
14. Solving Zero-One Problems (Part II)
15. Branch And Bond Algorithm For Integer Programming
16. Cutting Plane Algorithm
17. All Integer Primal Algorithm
18. All Integer Dual Algorithm
19. Network Models
20. Shortest Path Problem
21. Successive Shortest Path Problem
22. Maximum Flow Problem
23. Minimum Cost Flow Problem
24. Traveling Salesman Problem (TSP)
25. Branch and Bound Algorithms for TSP
26. Heuristics for TSP (Part I)
27. Heuristics for TSP (Part II)
28. Chinese Postman Problem
29. Vehicle Routeing Problem
30. Queueing Models
31. Single Server Queueing Models
32. Multiple Server Queueing Models
33. Game Theory
34. Critical Path Method
35. Quadratic Programming

In this course, Prof. G. Srinivasan gives 35 video lectures on Advanced Operations Research.

Course outline:
1. Advanced topics in Linear Programming
2. Integer Programming
3. Network Models
4. Travelling Salesman problem and extensions
5. Queueing Theory, Game theory, CPM and Quadratic Programming