[SCIP] How to get the Lower Bound while implementing the Branching Rule?

[Matheus Ota]

Hi,

Im trying to use SCIP to implement a Branch-Cut-and-Price for the VRP. For
now Im focusing only on the Branch-and-Cut part, using the CVRPSEP package (
http://econ.au.dk/research/researcher-websites/jens-lysgaard/cvrpsep/). I
already added the cuts and my program is able to solve some simple
instances, in order to increase its performance I need to implement custom
branching rules.

The branching rule works this way: it first select a few subsets of the set
of vertexes in the graph and impose a few constraints on them. It then
computes the lower bound (solving the relaxation) for each child node and
uses these values to choose the node to branch on. Could you please give me
some information about of how I can get the lower bound on the branching
rule callback? Or maybe a better way of doing this or something similar?

Thanks,
Matheus
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.zib.de/pipermail/scip/attachments/20180319/f0fe5eb1/attachment.html>