[Cbc] zero-half cuts

[John Forrest]

James,

Implementation of zero-half cuts?

Some years ago, while I was still at IBM, there was a submission of code 
- but I have no record of who submitted them!  I have just found the 
code on a disk and would be happy to test and put them in with due 
appreciation if the author would just e-mail me saying they were her/his 
work.  IBM had very strict rules on accepting code, which might have 
caused problems.   Do names such as Cgl012cut or Cgldikbd or 
CglZeroHalf  mean anything to anyone?

John Forrest

On 09/01/13 10:43, James.Gunning at csiro.au wrote:
> Hello All,
>         I'm new to the list, and have been learning a bit about cbc. First, a big thanks to the
> developers for making such a big tool available to all, & for all the effort that's gone in etc.
>
> I'm trying to use it to solve some binary QP problems for a binary vector x, of form
> min x^T.Q.x. I've done the standard tricks to unroll this out to a binary linear IP problem
> (new variables p_ij for products, inequalities to force these to match x_i, x_j)
>
> Test runs on cplex show that it uses zero-half cuts a good deal on the problem.
> Has anyone tried implementing zero-half cuts in cbc? Any success? Anything
> in the pipeline planned by some clever contributors?
>
> Best wishes all,
>       James.
> _______________________________________________
> Cbc mailing list
> Cbc at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/cbc
>
>