<div dir="ltr"><div><div><div>Hi all,<br><br></div>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. <br>
<br></div>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 =).<br>
<br></div>Regards,<br clear="all"><div><div><div><div><div><div><div><br>-- <br><div dir="ltr">Matthew Gidden<br>Ph.D. Candidate, Nuclear Engineering<div>The University of Wisconsin -- Madison<br>Ph. 225.892.3192<br></div>
</div>
</div></div></div></div></div></div></div></div>