It works!,Thanks Raphael,
Now, I have another question, I would be grathful if you could help me.
In this step, I need a constraint, something like cost function.
In detail, I have an alldiff{x(1),...,x(2n)} again with domains [1..2*n].
Now, I want in any feasible solution, there are atmost m (e.g m=5)
consecutive values,
For example,for m=5 and n=10 a feasible solution is {2,6,1,3,7,14,20,4,5,11}
but this is a infesible solution {2,6,8,3,7,14,20,4,5,11} (since number of
2,3,4,5,6,7,8 is seven).
I have some idea, but none of them works.
How can I impse it?
Cheers,
---------------------------------
All new Yahoo! Mail
---------------------------------
Get news delivered. Enjoy RSS feeds right on your Mail page._________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
