Algorithms for NP-Hard Problems (Section 21.4: Mixed Integer Programming Solvers)
Tim Roughgarden Lectures · 16:59
Most discrete optimization problems—including the NP-hard ones from *Algorithms Illuminated*—can be written as mixed integer programs (MIPs) and handed to a MIP solver, which is often worth trying before you invent a...