| |
Nov 25, 2024
|
|
|
|
|
MATH 8120 - Discrete Optimization3 Credits (3 Contact Hours)
Principal methods used in integer programming and discrete optimization; branch and bound, implicit enumeration, cutting planes, group knapsack, Lagrangian relaxation, surrogate constraints, heuristics (performance analysis), separation/branching strategies, and polynomial time algorithms for specific problems on special structures. Students are expected to have completed a graduate-level course in linear programming before enrolling in this course. Offered fall semester only.
Add to Portfolio (opens a new window)
|
|
