[SCIP] set cutoffbound

[Horváth Markó]

Dear all,

I'm working on a branch-and-price algorithm, and I want to apply a 
primal heuristic each time a feasible (integer) solution. Basically, I 
build a /schedule/ based on this solution, and I apply a local-search 
based approach to improve this schedule, and thus to get a better 
feasible solution. My problem is that I cannot create a SCIP solution 
since it may require columns/variables which are not generated for the 
problem yet. Actually, I do not need to create such a solution, it would 
be enough if I could set a cutoff bound for the problem (that is, to set 
a global upper bound for the objective, and thus nodes with higher 
lowerbound could be pruned. (Note that I did not implement primal 
heuristic callback due to the reasons mentioned above, but I apply this 
procedure in an event handler).

I could not find such a parameter in the list of all parameters, and I 
could not find solution for this problem in the list server archives. 
Can you help me?

Best regards,
Marko
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.zib.de/pipermail/scip/attachments/20220111/27f51349/attachment.html>