[gecode-users] 2-stage optimisation

Christian Schulte cschulte at kth.se
Thu Nov 13 15:04:15 CET 2008



I would start with the two stage approach, there is nothing wrong with that as far as I can see.






Christian Schulte, www.ict.kth.se/~cschulte/


From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf Of benoitlaurent at neuf.fr
Sent: Thursday, November 13, 2008 2:35 PM
To: users at gecode.org
Subject: [gecode-users] 2-stage optimisation


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

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20081113/aa8a7cef/attachment.htm>

More information about the gecode-users mailing list