ExactIP

Exact Integer Programming

Description

Available solvers for mixed integer programs (MIPs) focus on rapidly finding close to optimal solutions for feasible instances. The answers, however, are computed with finite precision, which might lead to wrong results. For most applications, the errors can be neglected. This situation changes fundamentally, if MIPs are used to study theoretical problems (i.e., a "computer proof" is needed), if feasibility questions are considered, and if wrong answers can have legal consequences. For such applications an exact MIP solver is required. The aim of this project is to develop such a solver. 

Further information is available in the detailed project description.

 Contact  

Kati Wolter

 Members  

Martin Grötschel  Thorsten Koch  Kati Wolter

 Partners  

William Cook: H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology in Atlanta, USA Daniel Espinoza: Departamento de Ingenieria Industrial, Universidad de Chile in Santiago, Chile Marc Pfetsch: Department of Mathematics, Technische Universität Darmstadt Daniel Steffy: Department of Mathematics and Statistics, Oakland University in Rochester, USA

 Funding  

DFG Priority Program 1307 "Algorithm Engineering"

 Duration 

07/2007 - 06/2013

---