gt;>>> Options opt("SEND+?MORE=MONEY");
>>>> opt.model(Money::MODEL_SINGLE);
>>>> opt.solutions(1);
>>>> Script::run(opt);
>>>> std::cout << "--- \n" ;
>>>> return 0;
>>&
pt);
>>> std::cout << "--- \n" ;
>>> return 0;
>>> }
>>> On Apr 21, 2014, at 4:12 AM, Christian Schulte wrote:
>>>
>>>> Just check the number of search steps needed, it can tell you something
>>>> more
t;>>
>>> Then (I am guessing here), given that your model is based on money it has
>>> lost of linear constraints in it, right? There you will only get propagation
>>> if by branching either the lower or upper bound of the values for a variable
>>> changes. If you
e, KTH, web.it.kth.se/~cschulte/
-Original Message-
From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf
Of negate...@gmail.com
Sent: Monday, April 21, 2014 02:47 AM
To: users@gecode.org
Subject: [gecode-users] Integer Variable Randomization
Hi, I'm seeing an exp
@gecode.org [mailto:users-boun...@gecode.org] On Behalf
> Of negate...@gmail.com
> Sent: Monday, April 21, 2014 02:47 AM
> To: users@gecode.org
> Subject: [gecode-users] Integer Variable Randomization
>
> Hi, I'm seeing an exponential time increase in the time to just rand
...@gecode.org] On Behalf
Of negate...@gmail.com
Sent: Monday, April 21, 2014 02:47 AM
To: users@gecode.org
Subject: [gecode-users] Integer Variable Randomization
Hi, I'm seeing an exponential time increase in the time to just randomize
integer variables. My test program is based on "examples
Hi, I’m seeing an exponential time increase in the time to just randomize
integer variables. My test program is based on “examples/money.cpp” , and I
removed the constraints and simply randomize the integer variables by using
INT_VAL_RND()
—>branch(*this, le, INT_VAR_SIZE_MIN(), INT_VAL
