This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Course Project Description IE418 Integer Programming Dr. Ralphs Due May 7, 2007 1 Overview The project is to implement and test a computational procedure related to the solution of a class or classes of mixed integer linear programs. Possible projects include Implementing a procedure for optimizing over the MIR, Chv atal or lift-and-project closures. Implementing a cut generation procedure for a class of valid inequalities. Implementing a solver for some class of combinatorial optimization problems. Implementing a specialized search and/or branching strategy. Starting with a basic branch-and-bound implementation, building a solver from ex- isting and/or new components available in COIN and elsewhere and try to improve its performance as much as possible. Implementing a specialized primal heuristic. In most cases, the implementation will be done using one of the various solver frameworks in which you can add customized procedures to an existing default algorithm. The framework most appropriate for doing this will depend on which project you select. I will help youmost appropriate for doing this will depend on which project you select....
View Full Document
This note was uploaded on 08/06/2008 for the course IE 418 taught by Professor Ralphs during the Spring '08 term at Lehigh University .
- Spring '08