[Scip] Integer solution found in pricing stage

[Stefan Heinz]

Hi Mehmet,

If an integer solution is found during the pricing loop the upper (primal)
bound is update accordingly.

As Gregor already indicated there is a heuristic timing which allows that
heuristics can run during the price loop:
http://scip.zib.de/doc/html/type__timing_8h.php#a2d53e1adb5711e9abba16a495cad4993

For example simple rounding runs per default with that timing:
http://scip.zib.de/doc/html_devel/heur__simplerounding_8c.php

Besides that it is also possible to set an upper (primal) bound without
any primal solution in hand. Such a bound can be passed to SCIP via the
method SCIPupdateCutoffbound()
http://scip.zib.de/doc/html/scip_8h.php#a254deea4e0be25d011db83004bd71262

or SCIPsetObjlimit()
http://scip.zib.de/doc/html/scip_8h.php#a3fd90b931b38d2d8f344114babc2a67e

Cheers Stefan

> Hello everyone,
>
> I am implementing a branch-and-price algorithm. I wanted to ask whether
> SCIP can update upper bound when the current solution to LP is an
> integer one and it is promising. I mean current solution found in the
> middle of pricing stage, not in the end of it. If this is not the case,
> how can I update the upper bound?
>
> Thank you in advance
>
> Mehmet
> _______________________________________________
> Scip mailing list
> Scip at zib.de
> http://listserv.zib.de/mailman/listinfo/scip
>