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
