[gecode-users] Limiting the number of solutions of a search's subtree

[Christian Schulte]

There has been a similar discussion along these lines (for only two
branchers) on this mailing list (using more than one search engine to get
the desired behavior). Please try to find it in the mailing list archives.

 

Christian

 

--

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

 

From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Andrea Peano
Sent: Wednesday, November 20, 2013 8:08 PM
To: users at gecode.org
Subject: [gecode-users] Limiting the number of solutions of a search's
subtree

 

Hello all,

I've installed 4 branchers in order to solve my model.

Although I need to compute the entire search tree of the first three
branchers, It would be very effective to limit the number of solutions of
the remaining subtrees.

 

In other words, given a leaf of the search three produced by the first three
branchers, I would compute only the first solution of the last one.

 

I read section 8.1 of the guide, named "Executing code between branchers",
and this behaviour seems to be achievable by posting some contraints,
somehow...

Is it the right way?

 

Do you have any suggestion?

 

Thank you,

Andrea

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20131120/3126c1d4/attachment.html>