Toggle navigation
Institute
IISc Bangalore
IIT Bombay
IIT Delhi
IIT Guwahati
IIT Kanpur
IIT Kharagpur
IIT Madras
IIT Roorkee
Discipline
Aerospace Engineering
Atmospheric Science
Basic courses
Biotechnology
Chemical Engineering
Chemistry and Biochemistry
Civil Engineering
Computer Science and Engineering
Electrical Engineering
Electronics & Communication Engineering
Engineering Design
General
Humanities and Social Sciences
Management
Mathematics
Mechanical Engineering
Home
Mechanical Eng.
Advanced Operations Research
Lecture# 22
'Maximum Flow Problem' Video Lecture
Maximum Flow Problem
Course
:
Advanced Operations Research
Discipline
:
Mechanical Engineering
Faculty
: Prof. G. Srinivasan
Institute
:
IIT Madras
Maximum Flow Problem
- Browse through
Advanced Operations Research (Mechanical Engineering)
Video Lectures by
Prof. G. Srinivasan
from
IIT Madras
through NPTEL.
Course
:
Advanced Operations Research
Discipline
:
Mechanical Engineering
Faculty
: Prof. G. Srinivasan
Institute
:
IIT Madras
NEXT LECTURE >>
Minimum Cost Flow Problem
Download this video in MP4, FLV & 3GP formats
Format
Size
Download
MP4
269 MB
MP4 Video Download Link 1
MP4
269 MB
MP4 Video Download Link 2
FLV
292 MB
FLV Video Download Link 1
FLV
292 MB
FLV Video Download Link 2
3gp
62 MB
3gp Video Download Link 1
3gp
62 MB
3gp Video Download Link 2
Search Courses by Discipline & Institute
Search Courses
Discipline
All Disciplines
Aerospace Engineering
Atmospheric Science
Basic courses
Biotechnology
Chemical Engineering
Chemistry and Biochemistry
Civil Engineering
Computer Science and Engineering
Electrical Engineering
Electronics and Communication Engineering
Engineering Design
General
Humanities and Social Sciences
Management
Mathematics
Mechanical Engineering
Institute
All Institutes
IISc Bangalore
IIT Bombay
IIT Delhi
IIT Guwahati
IIT Kanpur
IIT Kharagpur
IIT Madras
IIT Roorkee
SASTRA University
Search
Course Video Lectures
Introduction and Linear Programming
Revised Simplex Algorithm
Simplex Method for Bounded Variables
One Dimensional Cutting Stock Problem
One Dimensional Cutting Stock Problem (Contd)
Dantzig-Wolfe Decomposition Algorithm
Dantzig-Wolfe Decomposition Algorithm Primal-..
Primal-Dual Algorithm
Goal Programming-Formulations
Goal Programming Solutions Complexity of Simp..
Complexity of Simplex Algorithm (Contd) Integ..
Integer Programming-Formulations
Solving Zero-One Problems
Solving Zero-One Problems (Contd)
Branch And Bond Algorithm For Integer Program..
Cutting Plane Algorithm
All Integer Primal Algorithm
All Integer Dual Algorithm
Network Models
Shortest Path Problem
Successive Shortest Path Problem
Maximum Flow Problem
Minimum Cost Flow Problem
Traveling Salesman Problem (TSP)
Branch and Bound Algorithms for TSP
Heuristics for TSP
Heuristics for TSP (Contd)
Chinese Postman Problem
Vehicle Routeing Problem
Queueing Models
Single Server Queueing Models
Multiple Server Queueing Models
Game Theory
Critical Path Method
Quadratic Programming
Integer Programming(continued)
All Integer Dual Algorithm
Mixed Integer Linear Programming
Benders Partitioning Algorithm
2015. EngineeringVideoLectures.com