[SCIP] Help with the one-Tree algorithm

[Izuwa Ahanor]

Thank You very much Marc,

I would try this out and revert.

Sincerely,
Izuwa.


On Sun, 12 Sept 2021 at 05:35, Marc Pfetsch <
pfetsch at mathematik.tu-darmstadt.de> wrote:

>
>
> Dear Izuwa,
>
> SCIP already allows to do something similar, see
>
> https://www.scipopt.org/doc-7.0.3/html/COUNTER.php
>
> If you only want to generate solutions within x% of the optimal value,
> you can use the technique explained at the last section of that page.
>
> At least this functionality will give you a starting point (see also
> cons_countsols.c).
>
> Best
>
> Marc
>
> On 11/09/2021 17:37, Izuwa Ahanor wrote:
> > 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.
> >
> >
> > _______________________________________________
> > Scip mailing list
> > Scip at zib.de
> > https://listserv.zib.de/mailman/listinfo/scip
> >
> _______________________________________________
> Scip mailing list
> Scip at zib.de
> https://listserv.zib.de/mailman/listinfo/scip
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.zib.de/pipermail/scip/attachments/20210917/e9560a72/attachment.html>