[SCIP] About non-bust branch-price-and-cut

[Feng Gao]

Hi Marco, hi all,

Thanks. To be more specific, suppose we want to solve the vehicle routing problem with branch-price-and-cut method. We want to add subset-row inequalities, which is known to be non-robust. After separation of subset-row inequalities, we need to solve a modified pricing problem. My question is, how can we modify the pricing problem with the dual information of the cuts in SCIP?

Best regards,

Feng

-----Original Message-----
From: Marco Lübbecke [mailto:marco.luebbecke at rwth-aachen.de] 
Sent: Saturday, April 23, 2016 7:17 AM
To: Feng Gao <fgao784 at gmail.com>
Cc: scip at zib.de
Subject: Re: [SCIP] About non-bust branch-price-and-cut

Hi Feng, hi all,

this is most probably a question that does not primarily relate to the implementation. You may wish to be (much more) specific in explaining the model you are dealing with and post to a more general public eg.
here: https://www.or-exchange.org/

Marco


2016-04-23 4:07 GMT+02:00 Feng Gao <fgao784 at gmail.com>:
> Hi all,
>
> Is there anybody who have successfully implemented a non-bust 
> branch-price-and-cut with SCIP?
>
> If it is possible, then could you please enlighten me how to modify 
> the corresponding subproblem after the pricing structure is changed?
>
> Thank you!
>
> Regards,
>
> Feng
>
> _______________________________________________
> Scip mailing list
> Scip at zib.de
> http://listserv.zib.de/mailman/listinfo/scip
>



--
Prof. Dr. Marco Lübbecke
RWTH Aachen University
Chair of Operations Research
Kackertstrasse 7
D-52072 Aachen
Germany

fon / fax: +49 241 80-93362 / 92369
marco.luebbecke at rwth-aachen.de
www.or.rwth-aachen.de/luebbecke