Do you have a write-up of the mathematical formulation? If so, send it and if I have some free time, I'll take a look.<br><br><div class="gmail_quote">On Wed, Mar 21, 2012 at 8:25 AM, <span dir="ltr"><<a href="mailto:arocco@ing.uchile.cl">arocco@ing.uchile.cl</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Hello, my name is Adolfo from Chile, I am working on my thesis to solve a crew scheduling for a pharmacy, the problem is complicated in the sense ti has a lot of constraints and variables, I have been implementing a column generation in gams but each column has about 380 nodes (CP approach would not be good), so I do not know what would be a good approach to solve a branch and price, a friend of mine suggested me to email you because maybe the DIP (I do not know it) might be helpful.<br>
<br>
Regards Adolfo.<br>
______________________________<u></u>_________________<br>
Dip mailing list<br>
<a href="mailto:Dip@list.coin-or.org" target="_blank">Dip@list.coin-or.org</a><br>
<a href="http://list.coin-or.org/mailman/listinfo/dip" target="_blank">http://list.coin-or.org/<u></u>mailman/listinfo/dip</a><br>
</blockquote></div><br>