Jean-Guillaume Fages
Jean-Guillaume Fages
I have encoded it in Choco to see what it gives. I got the following model: public void testEuler(){ Solver s = new Solver(); int n = 100000; IntVar number...
You are right I have not seen this! Although it is not that straightforward, you can solve this efficiently by specifying a search heuristic : s.set(ISF.lexico_LB(number), new Once(new IntVar[]{mod},ISF.lexico_var_selector(),ISF.min_value_selector())); It...
Hi all, Actually, I do not think it should throw an exception, it should filter the domain to [offset, n-1+offset] The expected behavior is to have "no solution" if the...