IE 418 Discrete Optimization
|
|
Fundamentals of discrete optimization and modeling with linear, integer, and mixed-integer programming. Polyhedral theory, convex hulls, and relaxations. Valid inequalities for structured and general discrete optimization problems, and techniques for analyzing and comparing the strength of formulations. Solution methods including branch-and-cut, and cutting planes. Applications to classical combinatorial problems and real-world settings, with practical implementation using modern solvers.
Credit units: 3 ECTS Credit units: 5, Prerequisite:
IE 303.
|
|
|
Bilkent University Main Page
Last regenerated automatically on July 6, 2026 by OAC - Online Academic Catalog Software
|
|
