Hi Lingrui,
the easiest fix would be to upgrade to Visual Studio 2008 (that's what we
are using and what we have used to compile the packages). Unfortunately we
don't have access to Visual Studio 2005.
Would that be possible?
Cheers
Christian
--
Christian Schulte, www.ict.kth.se/~cschulte/
--
Dear all,
I have written a problem with a IntVarArray of size 49 for branching.
Each IntVar is in domain {0-2}
There are 30 something constraints. It turns out to run around 1 hour.
Is that a normal performance?
Is there any way I can optimize my program?
Any pointer for me in how to optimize m
Dear Jeffrey,
That’s not a performance issue, that’s a modeling issue. Without more detail
there is very little one could say but that if your model is poor, it might
search 3^49 nodes.
Did you try the standard modeling techniques: symmetry breaking, branching
heuristics, implied constr
I moved from 2.2.0 to 3.0.2.
When I recompile the program, it pops out error saying that elementsUnion is
not find.
I've included set.hh already.
Is the elementsUnion I used to use in 2.2.0 depreciated in 3.0.2? Is there any
other function I can use?
Regards,
Jeffrey
Yahoo!香港提供網上安全攻略，
Jeffrey wrote:
> I moved from 2.2.0 to 3.0.2.
>
> When I recompile the program, it pops out error saying that
> elementsUnion is not find.
>
> I've included set.hh already.
>
> Is the elementsUnion I used to use in 2.2.0 depreciated in 3.0.2? Is
> there any other function I can use?
The set e
