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 constraints, choosing sufficiently strong propagators for your constraints, and so on? Cheers Christian -- Christian Schulte, www.it.kth.se/~cschulte/ From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf Of Jeffrey Sent: Tuesday, March 31, 2009 8:24 PM To: gec...@gecode.org Subject: [gecode-users] Performance Issue of Gecode 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 my program? _____ Yahoo!香港提供網上安全攻略，教你如何防範黑客! <http://hk.promo.yahoo.com/security/> 了解更多
_______________________________________________ Gecode users mailing list us...@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
