Lec-12 Integer Programming-Formulations
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceThis lecture covers formulations and techniques for integer programming problems with various constraint types. It is a foundational segment in the NPTEL course on discrete optimization methods.
A 51-minute video from nptelhrd: “Lec-12 Integer Programming-Formulations”.
Video by nptelhrd, played through YouTube's embedded player.