[BCP] Lagrangian relaxation based branch and boumd

[Shahin Gelareh]

Dear bcp user,

What would be an efficient way to integrate a subgradient algorithm as the
relaxator/lp method for BCP when writing a Lagrangian relaxation-based
branch and bound.
if we use the volume algo then how we chose which constraints are being
relaxed in lagrangian fashion?

I appreciate any comment.
Thanks in advance.
Shahin
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/bcp/attachments/20121025/43c1aa9c/attachment.html>