|
Dec 09, 2024
|
|
|
|
ECE 612 - Discrete Optimization3 Credit Hours Greedy algorithm, matroid theory, network flow optimization, integer programming, branch and bound, cutting plane algorithm, Lagrangian duality, mixed integer programming. Registration Restriction(s): Minimum student level – graduate.
Add to Portfolio (opens a new window)
|
|