Main Profile

At A Glance

Mod-01 Lec-32 Min-cost-flow Sensitivity analysis Shortest path problem sensitivity analysis.

Linear programming and Extensions by Prof. Prabha Sharma, Department of Mathematics and Statistics, IIT Kanpur For more details on NPTEL visit http://nptel.iitm.ac.in
Length: 49:41

Contact

Questions about Mod-01 Lec-32 Min-cost-flow Sensitivity analysis Shortest path problem sensitivity analysis.

Want more info about Mod-01 Lec-32 Min-cost-flow Sensitivity analysis Shortest path problem sensitivity analysis.? Get free advice from education experts and Noodle community members.

  • Answer

Ask a New Question