We argue that constraint programs with one or more matrices of decision variables provide numerous benefits, as they share many patterns for which general methods can be devised, such as for symmetry breaking. On a wide range of real-life application domains, we demonstrate the generality and utility of such matrix modelling.
Note: Also released as Technical Report APES-36-2001 of the APES group, 2001, available at http://www.dcs.st-and.ac.uk/~apes/reports/apes-36-2001.ps.gz. Appears in the Proceedings of the CP-01 Workshop on Modelling and Problem Formulation. 7th International Conference on the Principles and Practice of Constraint Programming, 2001
Available as compressed Postscript (37 kB, no cover)
Download BibTeX entry.