G. Srinivasan: Advanced Operations Research (IIT Madras)

# playlist of the 39 videos (click the up-left corner of the video)

source: nptelhrd       2010年1月26日
Mechanical - Advanced Operations Research by Prof. G. Srinivasan, Department of Management Studies, IIT Madras.

Lec-1 Introduction and Linear Programming 1:02:27
Lec-2 Revised Simplex Algorithm 57:53
Lec-3 Simplex Method for Bounded Variables 49:30
Lec-4 One Dimensional Cutting Stock Problem 58:35
Lec-5 One Dimensional Cutting Stock Problem(Contd) 58:20
Lec-6 Dantzig-Wolfe Decomposition Algorithm 58:38
Lec-7 Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm 57:08
Lec-8 Primal-Dual Algorithm 57:37
Lec-9 Goal Programming-Formulations 50:12
Lec-10 Goal Programming Solutions Complexity of Simplex Algorithm 49:12
Lec-11 Complexity of Simplex Algorithm(Contd) Integer Programming 50:36
Lec-12 Integer Programming-Formulations 50:50
Lec-13 Solving Zero-One Problems 49:05
Lec-14 Solving Zero-One Problems(Contd) 49:09
Lec-15 Branch And Bond Algorithm For Integer Programming 47:50
Lec-16 Cutting Plane Algorithm 48:39
Lec-17 All Integer Primal Algorithm 50:38
Lec-18 All Integer Dual Algorithm 50:48
Lec-19 Network Models 58:16
Lec-20 Shortest Path Problem 58:04
Lec-21 Successive Shortest Path Problem 58:35
Lec-22 Maximum Flow Problem 58:21
Lec-23 Minimum Cost Flow Problem 58:32
Lec-24 Traveling Salesman Problem(TSP) 58:30
Lec-25 Branch and Bound Algorithms for TSP 58:06
Lec-26 Heuristics for TSP 58:08
Lec-27 Heuristics for TSP(Contd) 57:55
Lec-28 Chinese Postman Problem 58:23
Lec-29 Vehicle Routeing Problem 59:08
Lec-30 Queueing Models 58:33
Lec-31 Single Server Queueing Models 56:56
Lec-32 Multiple Server Queueing Models 56:13
Lec-33 Game Theory 58:36
Lec-34 Critical Path Method 57:56
Lec-35 Quadratic Programming 52:07
Lec 36 - Integer Programming(continued) 51:02
Lec 37 - All Integer Dual Algorithm 51:10
Lec 38 - Mixed Integer Linear Programming 51:43
Lec 39 - Benders Partitioning Algorithm 50:24