Hi,<div>This would depend on the structure of your problem. It is quite hard to tell.</div><div>Regards,</div><div>Pierre</div><div><br><div class="gmail_quote">On Wed, Jan 18, 2012 at 12:24 PM, Hossein Haghighat <span dir="ltr"><<a href="mailto:hosein.haghighat@gmail.com">hosein.haghighat@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">hello,<br>
I am using bonmin to solve an MINLP model. The execution time is very<br>
high considering different built-in algorithms (OA, BB,..).<br>
I have decided to use a benders decomposition (BD) to reduce the<br>
computing time. I was wondering if this would help reduce the time.<br>
_______________________________________________<br>
Bonmin mailing list<br>
<a href="mailto:Bonmin@list.coin-or.org">Bonmin@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/bonmin" target="_blank">http://list.coin-or.org/mailman/listinfo/bonmin</a><br>
</blockquote></div><br></div>