IE554 DISCRETE OPTIMIZATION
|METU Credit (Theoretical-Laboratory hours/week):
|Language of Instruction:
|Level of Study:
||Assoc.Prof.Dr. MUSTAFA KEMAL TURAL
||Fall or Spring Semesters.
The linear minimal cost flow problem and its solution by the network simplex algorithm. Maximal flow, shortest route and circulation problems. The integer programming problem and its solution by branch and bound and decomposition methods. Lagrangian relaxation.(R)