aboutsummaryrefslogtreecommitdiff
path: root/src/alg.h (unfollow)
Commit message (Collapse)AuthorFilesLines
2021-12-13Faster optimal solver.Sebastiano Tronto1-0/+2
This is a pretty big one, but unfortunately performance only improved by about 5%. I implemented one of the main ideas of nxopt, that is switching to the inverse scramble on the fly if it gives a lower branching factor. On the one hand it makes sense that it does not have such a huge impact, since it only rarely happens that we do have a lower branching factor on inverse, but on the other hand I am quite sad that the improvement is barely noticeable :-( Maybe the problem is that I have introduced a lot of new overhead and I can improve that in the future. Or maybe I am just overlooking something stupid.
2021-11-11Rewritten from scratch. Welocme nissy 2.0!Sebastiano Tronto1-0/+35

Generated with cgit - Back to sebastiano.tronto.net