A Strongly Polynomial Algorithm for Bimodular Integer Linear Programming

Simons Institute for the Theory of Computing is already on Lumen; this upload was never considered before. Channel treated as academic (strict check, default pass); title passed a strict per-title check; oEmbed verified.

A 32-minute video from Simons Institute for the Theory of Computing: “A Strongly Polynomial Algorithm for Bimodular Integer Linear Programming”.

Video by Simons Institute for the Theory of Computing, played through YouTube's embedded player.