[BCP] BCP and Constraint programming

[Ted Ralphs]

SYMPHONY only has code for VRP by branch-and-cut, but the DIP project
has an example of VRP solved by branch-and-price:

https://projects.coin-or.org/DIP

Generally speaking, DIP is easier to use with column generation, but a
little less powerful and flexible than BCP. At the moment, it requires
a compact formulation of the problem, which you may not have handy if
the subproblem is going to be solved with constraint programming.
There usually is a compact formulation in the case of VRP, but unlike
in other applications, it is not always the "natural" formulation.
Check out BCP and DIP and if you have questions, feel free to post
here or on the DIP mailing list.

Cheers,

Ted
-- 
Dr. Ted Ralphs
Associate Professor, Lehigh University
(610) 628-1280
ted 'at' lehigh 'dot' edu
coral.ie.lehigh.edu/~ted