[Coin-discuss] Set Cover

[einat or]

If its not too much trouble, I would be happy to get the code.
Do you remember How big was the set cover you solved? (variables? constrains?
density?)
How long did it take to get to the optimal solution?
Thanks so very much,
Einat

Laszlo Ladany

> Hi Einat,
>
> Partially. Couple of years ago I tried to solve the Seymour problem, which is
> a set covering problem. The code is a bit tailored towards Seymour, but not
> much. It uses LP relaxation only, no Lagrangian. The code uses an earlier
> version of BCP (not yet OSI based), but should not be too hard to update it.
> However, I do not have the time to do it until about next February. If you are
> interested I can dig it up, send it to you, and you can try to modify it. When
> it works with the current version of BCP it could go into COIN as another
> example. BTW, this is all dependent on whether I'm allowed to distribute the
> code.
>
> Cheers,
> --Laci
>
> On Wed, 4 Dec 2002, einat or wrote:
>
> > Hi,
> > I wish to use COIN to derive an application for the Set Cover problem.
> > (1372 constraints and 2500 variables).
> > I wish to implement lower bounding
> > based on Lagrangian relaxation
> > (In addition to the LP base bounding).
> > Was it ever done by anyone?
> > Any tips?
> > Thanks
> > Einat
> >
> > _______________________________________________
> > Coin-discuss mailing list
> > Coin-discuss at www-124.ibm.com
> > http://www-124.ibm.com/developerworks/oss/mailman/listinfo/coin-discuss
> >
>
> _______________________________________________
> Coin-discuss mailing list
> Coin-discuss at www-124.ibm.com
> http://www-124.ibm.com/developerworks/oss/mailman/listinfo/coin-discuss