Credit Hours: (3) Description Computational complexity: reductions, oracles and NP-completeness; five basic problems on convex sets in Euclidean spaces; pivoting, ellipsoid, and basis reductions methods; optimization on graphs; matching and stable set polytopes; algorithms on perfect graphs.
Add to Portfolio (opens a new window)
