INTEGER OPTIMIZATION
Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration. Students are strongly encouraged to have knowledge of Linear Programming (e.g.,MATH/COMP SCI/I SY E/STAT 525), including algorithms, duality and polyhedral theory.
未报告
未报告
按评分排序，数据来自 Rate My Professors
未找到教师。
课程先修和相关课程的可视化展示。
注意：我们并未显示所有可能的先修关系，仅显示与该课程直接相关的部分。
加载图表中...
该课程暂无课程安排信息。