[Cbc] Good cutting planes/heuristics for a bipartite network?

[Matthew Gidden]

Hi all,

I work on a project that has implemented a bipartite network model to solve
a multi-commodity supply-demand problem. We allow flows to be exclusive by
modeling them with binary variables and chose to use COIN's Cbc solver to
solve the resulting problem instances.

I was curious if the community was aware of cutting planes or heuristics
that work well with general bipartite networks, or with bipartite
supply/demand networks more specifically. I know that Cbc has a suite of
cut generators and heuristics available out of the box and would prefer to
target them (ie. use already-implemented solutions =).

Regards,

-- 
Matthew Gidden
Ph.D. Candidate, Nuclear Engineering
The University of Wisconsin -- Madison
Ph. 225.892.3192
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/cbc/attachments/20140724/1a9756d0/attachment.html>