Constraints on array's

[Gianni Alberti]

Hi.
I'm very new about Mozart and perhaps my question is silly , but
I would like to submit it anyway.
The problem model is based on a 2 dimensional array that
for now and for simplicity whe can consider whit all elements 0#1.
The constrained variables to define are all the elements of the array.

1) How to define a 2 dim array of costrained elements ?
2) How to address a single element of the array (example Array.Xelem.Yelem)
3) How to define that the solution to identify is of all array elements ?

Contraint to apply (example)
a) for each row the sum of 1 must be between  1 and N1 and equally distributed
b) for each column the sum of 1 must be bewtween 1 and N2
c) in a row only few sequence (of fixed lenght) are allowed :
    example = 11000 01100 00011

This model has been solved using a old language called Charme (Bull), precursor
of Ilog .
Is really my interested to see if Mozart can be applied to this problem as well.
When can I get more information ?
Tks for answering .

Gianni Alberti
c2s computer system & software
Milan - Italy
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.gforge.info.ucl.ac.be/pipermail/mozart-users/attachments/20020202/0967d6a0/attachment.html