[gecode-users] independent subproblems

Malcolm Ryan malcolmr at cse.unsw.edu.au
Wed Apr 9 02:50:44 CEST 2008


Reading your paper that sounds like exactly what I'm looking for. It's  
still at the experimental stage, I take it? Any plans to integrate it?

Malcolm

On 09/04/2008, at 12:26 AM, Guido Tack wrote:
> Malcolm,
>
> we have been working on this kind of decomposition, you can find a  
> preliminary technical report at
> http://arxiv.org/abs/0712.2389
>
> The resulting system needs some extensions to Gecode, so it is  
> currently not available in Gecode directly.
>
> Cheers,
> 	Guido
>
> Malcolm Ryan wrote:
>
>> 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
>> users at gecode.org
>> https://www.gecode.org/mailman/listinfo/gecode-users





More information about the gecode-users mailing list