[SCIP] Help with the one-Tree algorithm

[Izuwa Ahanor]

Hello,

I am trying to implement the one-tree algorithm (Generating Multiple
Solutions for Mixed Integer Programming Problems Danna etal 2007) where I
can query the search tree for solutions within x% of the optimal solution
and carry out further actions on the returned nodes.

Could you recommend how I could achieve this on SCIP? Possible methods
would be helpful.

Thanks a lot for helping.

Izuwa.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.zib.de/pipermail/scip/attachments/20210911/2d3237d4/attachment.html>