Learn · Advanced Operations Research
Lecture 14 of 39Integer Programming
Solving Zero-One Problems (Contd)
Prof. G. Srinivasan · IIT Madras
Credits and licence
- From
- Advanced Operations Research, IIT Madras (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the 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-Dual Algorithm
- Primal-Dual Algorithm
- Goal Programming-Formulations
- Goal Programming Solutions Complexity of Simplex Algorithm
- Complexity of Simplex Algorithm (Contd) Integer Programming
- Integer Programming-Formulations
- Solving Zero-One Problems
- Solving Zero-One Problems (Contd)
- Branch And Bond Algorithm For Integer Programming
- 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