[gecode-users] (adaptative) Incremental search

[Christian Schulte]

Hi,

please use the DFS engine and program a restart engine from that allowing to
change the order. That should be quite easy.

As it comes to examples for branching. Gecode contains some 20 examples:
check how the integer and set branchings are obtained from the class you
mention! Straightforward.

Cheers and good luck!
Christian

--
Christian Schulte, http://www.imit.kth.se/~schulte/ 

-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Luis Quesada
Sent: Thursday, January 19, 2006 11:43 PM
To: users at gecode.org
Subject: [gecode-users] (adaptative) Incremental search


Dear all,

We want to implement an (adaptative) incremental search: we want to find 
one solution, then depending on the solution found and on the 
interactions with the user re-define the order constraint on the fly, 
and then ask the search engine to find the next one and so on.

We think we can do this by using 
http://www.gecode.org/gecode-doc-latest/classGecode_1_1Restart.html. 
However, we don't know how to re-define the order constraint on the fly...

Another thing that we need to do is to define our own labeling strategy. 
We think the idea is to use:

http://www.gecode.org/gecode-doc-latest/classGecode_1_1ViewValBranching.html

However, we wonder whether you could provide us with a simple example 
that lets us get started.

Thanks in advance for your help,

Luis

_______________________________________________
Gecode users mailing list
users at gecode.org https://www.gecode.org/mailman/listinfo/gecode-users