[Cgl] [Cbc] Cut generators depending on upper bounds

[Ted Ralphs]

This is really an issue for the Cut Generator Library

http://projects.coin-or.org/Cgl

I am copying this thread over to that mailing list. This is something
that has come up in the past and it seems like a good idea. There are
actually a number of improvements that could be made to the API of Cgl
to provide more information, but changing the API is going to be a bit
painful and require some effort, due to the number of projects that
depend on it, among other things. We simply haven't had the bandwidth
to undertake it. However, we always welcome the participation of
additional developers if you want to undertake it! For now, I suggest
filing a ticket in the Cgl issue tracker.

Cheers,

Ted

On Fri, Apr 30, 2010 at 7:04 AM, Thomas Schoenemann <tosch at maths.lth.se> wrote:
> Dear all,
>
> I want to write a column cut generator that needs to know the best known upper
> bound (i.e. the cost of the best known integral solution). Is there any way to
> achieve that with the current Cbc-release?
>
> If not, I think it would be a useful feature. In combination with special
> ordered sets (of binary variables) one could probably define a general purpose
> cut generator.
>
> Best regards,
>  Thomas
>
> _______________________________________________
> Cbc mailing list
> Cbc at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/cbc
>



-- 
Dr. Ted Ralphs
Associate Professor, Lehigh University
(610) 628-1280
ted 'at' lehigh 'dot' edu
coral.ie.lehigh.edu/~ted