Session 1B - Automating Cutting Planes is NP-Hard

About this video

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

Proves NP-hardness of automating cutting-plane generation in integer programming. Teaching complexity results on optimization solver design.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020