On Matrices, Automata, and Double Counting - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

On Matrices, Automata, and Double Counting

Résumé

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.

Dates et versions

hal-00915717 , version 1 (09-12-2013)

Identifiants

Citer

Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson. On Matrices, Automata, and Double Counting. 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, Jun 2010, Bologna, Italy. ⟨10.1007/978-3-642-13520-0_4⟩. ⟨hal-00915717⟩
140 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More