I don't think so: DeltaStar (if I remember correctly) requires a special filter function. For Gecode that would mean to re-implement every single constraint. That's infeasible.
Did you try the naive one: reify the constraints and maximize the number of satisfied constraints (after all, 30 constraints are not that much). Christian -- Christian Schulte, www.ict.kth.se/~cschulte/ From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf Of Jeffrey Sent: Monday, February 02, 2009 3:50 PM To: gec...@gecode.org Subject: [gecode-users] Constraint Hierarchy on Gecode My problem involve 30 something constraints on a finite SetVar. It involve 2 required constraints. All the rest are soft constraints. I need to find a solution that can give me solutions which satisfy the most constraints. So, should I implement the Algorithm myself to solve the Constraint Hierarchy? Is there any examples or reference you would recommended? The most straight one I can think of is the DeltaStar. _____ Yahoo!香港提供網上安全攻略，教你如何防範黑客! <http://hk.promo.yahoo.com/security/> 了解更多
_______________________________________________ Gecode users mailing list us...@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
