Week - 1 |
Introduction to network models and graphics |
Week - 2 |
Introduction to Gurobi and some applications |
Week - 3 |
Shortest path problem and applications, algorithms for SPP |
Week - 4 |
Maximum flow problem and its applications, other algorithms for maximum flow problem |
Week - 5 |
Max Flow-Min Cut theorem and Ford Fulkerson algorithm |
Week - 6 |
Max Flow-Min Cut theorem and Ford Fulkerson algorithm |
Week - 7 |
Minimum cost network flow problem and its applications |
Week - 8 |
Optimality conditions and basic algorithms, other algorithms for solving minimum cost network flow problems |
Week - 9 |
Assignment and matching problems |
Week - 10 |
Minimum spanning tree problem |
Week - 11 |
Traveling salesman problems and their types |
Week - 12 |
Project Management |
Week - 13 |
Network simplex algorithm |
Week - 14 |
Presentations |