ORIE 4370 Computational Optimization
NOT OFFERED THIS YEAR Spring. 4 credits. Prerequisite: ORIE 3300. Corequisite: ORIE 3310. Next offered 2010–2011.
Covers computational implementation and related methodology for solving large-scale, real-world integer programming problems. Primary emphasis is on branch-and-cut technology: pre-processing, cut strength, exact and heuristic separation techniques, branching strategies, multi-processing. Hands-on experience with state-of-the-art software for various discrete optimization models, including the traveling salesman, capacitated vehicle routing, and air crew scheduling models; experimentation with massively parallel computational implementation on the IBM BlueGene computer for the largest feasible subsystem problem.