At a certain stage in my search the problem can be split into several  
independent sub-problems. If I try to solve them sequentially, then a  
failure in one of the later ones will cause fruitless backtracking in  
the earlier ones (when it really needs to jump all the way back to the  
first phase of the search). Does Gecode provide any kind of mechanism  
for handling this situation?

Thanks,

Malcolm

_______________________________________________
Gecode users mailing list
[EMAIL PROTECTED]
https://www.gecode.org/mailman/listinfo/gecode-users

Reply via email to