بحوث العمليات المتقدمة

المصدر: nptelhrd

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