[Cbc] zero-half cuts

[James.Gunning at csiro.au]

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.