everything.study
ORI 391Q.4

Integer Programming

3 Hours

Models, theory, and computational methods for problems with discrete decision alternatives. Greedy algorithms, branch and bound, cutting plane methods, Lagrangian relaxation, and heuristics.

Prerequisites & course information

Models, theory, and computational methods for problems with discrete decision alternatives. Greedy algorithms, branch and bound, cutting plane methods, Lagrangian relaxation, and heuristics.

Sources