Lec-16 Cutting Plane Algorithm

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

This lecture explains the cutting plane algorithm, a technique for solving integer programming problems by tightening linear relaxations. It is a segment in the NPTEL integer programming course unit.

A 49-minute video from nptelhrd: “Lec-16 Cutting Plane Algorithm”.

Video by nptelhrd, played through YouTube's embedded player.

Part of Mechanical - Advanced Operations Research