Lecture 39 of 40Week 8
Lecture 39 : Shortest Path Problems
Prof. Biswajit Mahanty · IIT Kharagpur
Credits and licence
- From
- Decision Modeling, IIT Kharagpur (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Teens profiles and older. How courses are placed
All the lectures
- Lecture 1 : Decision Analysis : Introduction
- Lecture 2 : Payoff Matrix
- Lecture 3 : Decision Making Under Risk
- Lecture 4 : Value of Information
- Lecture 5 : Probability Concepts
- Lecture 6 : Bayes Theorem
- Lecture 7 : Decision Tree
- Lecture 8 : Decision Problem with Experimentation
- Lecture 9 : Decision Problem with Experimentation (Contd.)
- Lecture 10 : Decision Problem Example
- Lecture 11 : Introduction to Waiting Lines
- Lecture 12 : Poisson and Exponential Distribution
- Lecture 13 : Birth and Death Process
- Lecture 14 : M/M/1 Queuing Model
- Lecture 15 : Queuing Examples
- Lecture 16 : Queuing Examples (Contd.)
- Lecture 17 : M/D/1 and M/M/s Queuing Models
- Lecture 18 : M/M/s and M/M/infinity Models
- Lecture 19 : Finite Queue Space and Queuing Cost Models
- Lecture 20 : Queuing Cost, Priority and Networking Models
- Lecture 21 : Introduction to Simulation
- Lecture 22 : Discrete-Event and Monte-Carlo Simulation
- Lecture 23 : Pseudorandom Numbers
- Lecture 24 : Simulation Examples
- Lecture 25 : Generation of Random Variates
- Lecture 26 : Simulation Examples (Contd.)
- Lecture 27 : Monte-Carlo Simulation and Output Analysis
- Lecture 28 : Variance Reduction and Simulation Software
- Lecture 29 : Continuous Simulation and System Dynamics
- Lecture 30 : System Dynamics Example
- Lecture 31 : Introduction to Graph Theory
- Lecture 32 : Introduction (Contd.)
- Lecture 33 : Operations on a Graph, Tree and Spanning Tree
- Lecture 34 : Minimal Spanning Tree
- Lecture 35 : Cutsets
- Lecture 36 : Maximal Flow Problems
- Lecture 37 : Maximal Flow Problems (Contd.)
- Lecture 38 : Maximal Flow Problems (Contd.)
- Lecture 39 : Shortest Path Problems
- Lecture 40 : Shortest Path Problems (Contd.)