[Scip] obtaining feasible solutions encountered during B&B (not counting all solutions)

[Stefan Vigerske]

Hi,

SCIP already stores suboptimal solutions that are found during search.
You can access them after solve with SCIPgetNSols() and SCIPgetSols().
By default, only at most 100 best solutions are stored. You can increase 
this limit via the limits/maxsol and limits/maxorigsol parameters.

Hope this helps,
Stefan

On 07/09/2012 10:37 PM, Miles Lubin wrote:
> Hello,
>
> I would like to obtain a list of feasible solutions encountered when
> solving a problem during regular branch-and-bound, including those
> generated by both heuristics and fathomed nodes. It doesn't seem like
> the countsols constraint handler can do this. Any suggestions? The
> problem I'm solving is essentially a pricing subproblem in
> branch-and-price, and I'd like to be able to generate multiple columns
> by including near-optimal solutions.
>
> Thanks,
> Miles
> _______________________________________________
> Scip mailing list
> Scip at zib.de
> http://listserv.zib.de/mailman/listinfo/scip
>