Hi, I am running the complete search to find a solution for a scheduling problem. I see that there are cases when if don't specify once in front of the search predicate the solver runs out of memory. When I am using once I obtaine the solution. How this fact can be explained ? BR, Bogdan.Received on Wed May 12 2010 - 09:47:24 CEST
This archive was generated by hypermail 2.3.0 : Wed Sep 25 2024 - 15:13:20 CEST