[SCIP] Optimal MIP branching

[Hanan Rosemarin]

Hi

I am interested in evaluating variable branching heuristics in MIP solvers,
using SCIP.

Are there problems for which the *optimal* integer branching is known?
If not, are there problems that are small enough so that it is possible to
evaluate all possible variable branching yet still be "interesting" in the
sense that their result would be meaningful and indicative of the solver's
performance?

I'd appreciate any suggestion regarding available data and implementation
tips

Thanks

Hanan
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.zib.de/pipermail/scip/attachments/20171224/21ea10f4/attachment.html>