| Commit message (Collapse) | Author | Files | Lines | ||
|---|---|---|---|---|---|
| 2021-12-17 | some progress | Sebastiano Tronto | 1 | -2/+1 | |
| 2021-12-13 | Faster optimal solver. | Sebastiano Tronto | 1 | -3/+5 | |
| 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-12-09 | Multi-threaded pruning table generation - now it's actually fast :) | Sebastiano Tronto | 1 | -1/+1 | |
| 2021-12-07 | Little performance improvement in optimal solver - more to come! | Sebastiano Tronto | 1 | -0/+2 | |
| 2021-11-20 | Multithreading seems to be working now, it was easier than expected! | Sebastiano Tronto | 1 | -1/+1 | |
| 2021-11-15 | Load all necessary pruning tables for a step before the actual solving process | Sebastiano Tronto | 1 | -0/+2 | |
| starts. This is in preparation for multi-threaded solving (but don't get hyped, it will take time). | |||||
| 2021-11-11 | Rewritten from scratch. Welocme nissy 2.0! | Sebastiano Tronto | 1 | -0/+10 | |
