[Coin-discuss] Description of cuts in CGL
Laszlo Ladanyi
ladanyi at us.ibm.com
Fri Jul 15 23:00:22 EDT 2005
The CglMixedIntegerRounding2.cpp cuts are level two MIR cuts and also related
to Gomory's group based cuts. Oktay or Sanjeeb could give more info, so I cc'd
them.
Oktay, Sanjeeb, can you enlighten the general public :-)? Maybe even put the
info into the header as a comment?
Thanks,
--Laci
On Wed, 29 Jun 2005, Matthew Galati wrote:
> Hi Miroslav,
>
> The MIR cuts (CglMixedIntegerRounding.cpp) were written by Joao
> Goncalves (jog7 at lehigh.edu) and Laszlo Ladanyi (ladanyi at us.ibm.com) and
> is based on this paper:
>
> - MARCHAND and L. A. WOLSEY. Aggregation and mixed integer rounding to
> solve MIPs.
> - http://www.core.ucl.ac.be/services/psfiles/dp98/dp9839.pdf
>
> MixIntRoundVUB is just a data structure used in constructing MIR cuts.
>
> There does seem to be a CglMixedIntegerRounding2.cpp now. I am not sure
> why - maybe the authors can explain. Perhaps just a revised implementation?
>
> Matt G
>
> --
> Matthew Galati - Optimization Developer
> SAS Institute - Analytical Solutions
> Phone 919-531-0332, R5327
> Fax 919-677-4444
> http://coral.ie.lehigh.edu/~magh
> http://ordlnx2.na.sas.com/projects/OptWiki
> http://www.sas.com/technologies/analytics/optimization/
>
>
>
> > Hi,
> >
> > Is there a description of the cuts in CGL?
> > In particular, I am interested in MIR cuts and I see several
> > generators. What is the difference between MixedIntegerRounding and
> > MixIntRoundVUB?
> >
> > Thank you,
> > Miroslav
> >
> > _______________________________________________
> > Coin-discuss mailing list
> > Coin-discuss at list.coin-or.org
> > http://list.coin-or.org/mailman/listinfo/coin-discuss
>
>
> _______________________________________________
> Coin-discuss mailing list
> Coin-discuss at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/coin-discuss
>
More information about the Coin-discuss
mailing list