Jean-Guillaume Fages
Jean-Guillaume Fages
Hi Dmitry, Thank you very much for your kind support. Thank you for your questions which have pointed out important aspects of the project. I will try to provide you...
good idea, can you do it?
Removing that line should not reduce the memory consumption : - The graph relies on a fixed-size bitset implementation, so moving from 1 to 0 a bit will not change...
I do not have the details of your problem and each case is different. However, I still feel that saving edges during solving should not be the solution (because it...
In the choco 3 approach, the graph was computed only once at root node and never edited afterward. If no filtering occurs at root node, it is equivalent to having...
Hi, I agree with Arnaud that the seed should remain fixed to ensure reproducibility. Note that only the first decision will always be of the form xi = i, then...
I am not sure to follow but in my understanding, IntVar.MAX_INT_BOUND was only a help to have a good behavior by default, but should not be a hard restriction. I...
this looks good to me, but if it is a log and not an exception, maybe we can even use if max > IntVar.MaxIntBound.
I see your point, but I would not tag it as a bug. It is true that some settings cannot be modified afterwards (I think only the setInitSolver is concerned,...
Hi guys, @aengelberg, I have provided a clean workaround for the mod problem here: https://github.com/chocoteam/choco3/issues/272 is that ok for you? @Misophistful, we are used to releasing the code every 3-6...