ThatÂ’s explained in the documentation. Look for stop objects.
Christian
--
Christian Schulte, www.ict.kth.se/~cschulte/
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf
Of Mauricio Toro
Sent: Thursday, June 19, 2008 7:59 AM
To: gecode list
Subject: [gecode-users] about the
Mauricio Toro wrote:
> Can you give some information about how to run the BAB search with a
> time limit?
> I am interesting in that too.
Please read the documentation on BAB and Stop objects, in particular
TimeStop.
Cheers,
Guido
___
Geco
Hello Juan Carlos, Guido and all,
Can you give some information about how to run the BAB search with a time
limit?
I am interesting in that too.
Thanks,
Mauricio
2008/6/18 Juan Carlos <[EMAIL PROTECTED]>:
> Exactly! is large neighborhood search. And I get your idea is very clever.
> thanks.
>
>
Exactly! is large neighborhood search. And I get your idea is very clever.
thanks.
Juan Carlos.
On Wed, Jun 18, 2008 at 3:08 PM, Guido Tack <[EMAIL PROTECTED]> wrote:
> Juan Carlos wrote:
>
> Now I see, I was confused about how the backtrack works.
>>
>> The idea is a Local Search Method, firs
Juan Carlos wrote:
> Now I see, I was confused about how the backtrack works.
>
> The idea is a Local Search Method, first find a basic solution, and
> then make little changes till the best solution is found, here are
> the steps:
>
> 1)choose the best value for each variable (this value is
> Now I see, I was confused about how the backtrack works.
>
> The idea is a Local Search Method, first find a basic solution, and then
> make little changes till the best solution is found, here are the steps:
>
> 1)choose the best value for each variable (this value is selected by a
> function
Juan Carlos wrote:
> In order to find the best solution of a problem that I'm working
> on, I have to branch over an IntVarArray , so I have created a
> custom branch with an heuristic. (like in the black hole or queens
> example). And use the BAB engine.
>
> This branching works fine, bu
Hello:
In order to find the best solution of a problem that I'm working on, I have
to branch over an IntVarArray , so I have created a custom branch with an
heuristic. (like in the black hole or queens example). And use the BAB
engine.
This branching works fine, but it could be improved if th
