[Coin-discuss] Simpler samples to BCP?

[Matthew Galati]

Hi Folks,

I finally got around to putting together a "simple" example of doing 
branch and price using BCP. I used the Axial Assignment Problem (AAP) 
and tried to make the example simple and illustrative. There is an 
associated write-up and the source is heavily commented. Some time in 
the future, I plan to post a "simple" version of AAP doing branch and 
cut, as well as full branch, price and cut.

The write-up and source are posted on Lehigh's COIN tutorial site:
http://sagan.ie.lehigh.edu/coin/

Let me know if you have any questions or problems running the example.

Matt




> Hello.
> 
> I am new to BCP. I am trying to develop a (sequential) Column Generation
> algorithm. Navigating through the classes + reading the examples is
> becoming very tedious and time consuming.
> 
> I really don't know where to start!
> 
> Does anyone has a simple sample code that justs customizes (overloads)
> the more essential things (reading the problem and adding variables with
> negative reduced cost)?
> 
> Any help would be really appreciated.
> 
> Thanks in advance.
> 
> --
> Ing. Alfredo Olivera
> 
> _______________________________________________
> Coin-discuss mailing list
> Coin-discuss at www-124.ibm.com
> http://www-124.ibm.com/developerworks/oss/mailman/listinfo/coin-discuss

-- 
Matthew Galati
ISE Lehigh University
IBM Service Parts Solutions
610.758.4042 (Office)
610.882.0779 (Home)
magh at lehigh.edu, magal11 at us.ibm.com
http://sagan.ie.lehigh.edu/mgalati/