Hi,
I would start with the two stage approach, there is nothing wrong with that as far as I can see. Cheers Christian -- Christian Schulte, www.ict.kth.se/~cschulte/ From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of [EMAIL PROTECTED] Sent: Thursday, November 13, 2008 2:35 PM To: [EMAIL PROTECTED] Subject: [gecode-users] 2-stage optimisation Hello, I would like to realize a 2-stage optimisation. More precisely, a first phase using a branch-and-bound algorithm provides me with an upper bound that is used to constrain the second phase. My question is the following: do I have to declare two spaces and two engines to achieve this or is there a better way of doing ? Thanks in advance. Benoît Laurent
_______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users
