IE 518 Discrete Optimization
|
|
The models and methods of integer programming. Structure of integer programs, pure integer and mixed integer programming problems. Zero-one programming, branch and bound methods. Cutting plane and polyhedral approach. Lagrangian relaxation. Applications to combinatorial optimization, heuristic methods and dynamic programming. Applications in resource allocation, facility location, scheduling, capital budgeting. Computer implementation.
Credit units: 3 ECTS Credit units: 5.
|
|
|
Bilkent University Main Page
Last regenerated automatically on April 19, 2024 by OAC - Online Academic Catalog Software
|
|
