Lecture

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

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