You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I am currently using python-constraint to generate specific budget allocations I can then feed into an optimisation engine. The constraints these allocations must obey are quite complex and python-constraint proves to be really useful in finding them.
I would need to generate just a limited amount of allocations, however the current implementation of GetSolutions() aims always at computing all of them. As a consequence sometimes it takes ages to get access to any useful result.
Wouldn't be possible to add an additional parameter in GetSolutions() to tune the number of solutions the solver has to produce? This would help in reducing the amount of time a user has to wait to get some result.
The text was updated successfully, but these errors were encountered:
I just had a similar problem and there's an undocumented function 'getSolutionIter' that might be useful! It returns an iterable, so you can pull as many solutions as you'd like.
I am currently using python-constraint to generate specific budget allocations I can then feed into an optimisation engine. The constraints these allocations must obey are quite complex and python-constraint proves to be really useful in finding them.
I would need to generate just a limited amount of allocations, however the current implementation of GetSolutions() aims always at computing all of them. As a consequence sometimes it takes ages to get access to any useful result.
Wouldn't be possible to add an additional parameter in GetSolutions() to tune the number of solutions the solver has to produce? This would help in reducing the amount of time a user has to wait to get some result.
The text was updated successfully, but these errors were encountered: