[BCP] BCP and Constraint programming

[Francois Margot]

Jose:

The introductory eample for Bcp is in the subdirectory Bcp/examples/BAC.
There is a pdf file with installation instruction and introduction to
the Branch-and-Cut part of Bcp. Unfortunately, for the Branch-and-price
part, there is not much up to date description. There are other examples
in Bcp/examples (MCF-1, MCF-2, and MCF-3) that illustrate
branch-and-price and that are possibly easier to understand that MKC.

As a side note, you might want to look at the SYMPHONY project, as it
has an application code for solving VRP by branch-and-price.

Francois


On Thu, 2010-12-02 at 12:00 -0500, bcp-request at list.coin-or.org wrote:
> > From: jose rojas mejias <joserojasmejias at gmail.com>
> > To: bcp at list.coin-or.org
> > Subject: [BCP] BCP and Constraint programming
> > Date: Thu, 2 Dec 2010 01:26:04 -0300
> > 
> > Dear All
> > 
> > I'm Jose Rojas, a new member of the mailing list, and i have some
> > questions.
> > In my thesis, I want to solve a VRP with B&P, but i'm having some
> > problems to understand the example of B&P (MKC). Is there any
> > explanation of the codes besides the documentation?
> > Second, one of my advisor's ideas is solve the sobproblem with
> > Constraint Programming. Is possible to do that with BCP?
> > 
> > Thanks!!!!!
> > 
> > Jose
> _______________________________________________
> BCP mailing list
> BCP at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/bcp