On Matrices, Automata, and Double Counting
Number of Authors: 4
2010 (English)Conference paper (Refereed)
Matrix models are ubiquitous for constraint problems. Many such problems have a matrix of variables M, with the same constraint defined by a finite-state automaton A on each row of M and a global cardinality constraint gcc on each column of M. We give two methods for deriving, by double counting, necessary conditions on the cardinality variables of the gcc constraints from the automaton A. The first method yields linear necessary conditions and simple arithmetic constraints. The second method introduces the cardinality automaton, which abstracts the overall behaviour of all the row automata and can be encoded by a set of linear constraints. We evaluate the impact of our methods on a large set of nurse rostering problem instances.
Place, publisher, year, edition, pages
2010, 8. 10-24 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-23774OAI: oai:DiVA.org:ri-23774DiVA: diva2:1042851
Seventh International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming
Lecture notes in computer science; 6140. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings. Springer 20102016-10-312016-10-31Bibliographically approved