See http://soda.swedish-ict.se/5194/ for a recipe on how to reify many global
constraints. For reifying Distinct (called AllDifferent in that technical
report), you need Sorted (called Sort there).
Cheers,
Pierre
Guido Tack wrote, on 2012-04-23 06:00:
Hi,
you can look through the API documentation (or the int.hh header file) for the
constraints that take an additional BoolVar as the last argument, those are the
ones that support reification. Concerning your concrete question, there are
reified linear constraints but no reified distinct.
Cheers,
Guido
--
Guido Tack
http://www.csse.monash.edu/~guidot/
On 23/04/2012, at 1:48 PM, Md Solimul Chowdhury wrote:
Hi,
Greetings.
I am currently engaged with a research project, for which I need to model CSPs with
reified global constraints. In the Gecode manual, "Modelling and Programming with
Gecode", I did not find much discussion on modeling CSPs with reified global
constraints. In the current version of Gecode, which global constraints have reified
versions? I am particularly interested with the reified versions of Linear and Distinct
global constraints, if there is any. Any pointer to a resource, which contains a sample
Gecode model with reified global constraints will be appreciated.
Thanks in advance.
Solimul Chowdhury
Department of Computing Science
University of Alberta, Canada.
_______________________________________________
Gecode users mailing list
[email protected] <mailto:[email protected]>
https://www.gecode.org/mailman/listinfo/gecode-users
_______________________________________________
Gecode users mailing list
[email protected]
https://www.gecode.org/mailman/listinfo/gecode-users
_______________________________________________
Gecode users mailing list
[email protected]
https://www.gecode.org/mailman/listinfo/gecode-users
