Re: [boost] A possible GSOC 2011 proposal idea

Subject: Re: [boost] A possible GSOC 2011 proposal idea
From: Mathias Gaunard (mathias.gaunard_at_[hidden])
Date: 2011-03-20 11:54:01

On 20/03/2011 13:17, Chad Seibert wrote:

> A second type of LP problem is where we require all the variables to be
> integers. Such an LP is called an integer programming problem, or ILP. We
> first note that solving ILP's is NP complete, therefore, there seems to be
> no efficient way to solve these kinds of problems. Nevertheless, algorithms
> have been developed to solve them and in practice, perform well. In
> particular, the cutting plane and branch and bound methods will be
> implemented.

I personally have need of a compile-time ILP solver.

Would you be interested in working on that?