Lecture

Mod-03 Lec-17 Dynamic Programming: Capacity expansion and shortest route problems

Video Player is loading.
Current Time 0:00
/
Duration 1:00:49
Loaded: 0%
Progress: 0%
Stream Type LIVE
Remaining Time -1:00:49
 
1x

In this module, students will learn to solve capacity expansion and shortest route problems using dynamic programming, crucial for efficient water resource management.


Course Lectures