On matrices, automata, and double counting in constraint programming

DOI10.1007/s10601-012-9134-yzbMath1316.90043DBLPjournals/constraints/BeldiceanuCFP13aOpenAlexW2151877291WikidataQ57574239 ScholiaQ57574239MaRDI QIDQ2342587

Mats Carlsson, Justin Pearson, Pierre Flener, Nicolas Beldiceanu

Publication date: 29 April 2015

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-012-9134-y

zbMATH Keywords

matrix modelnurse schedulingdouble countingautomaton constraintnecessary (implied) constraint

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Uses Software

• SLIDE
• SICStus

Cites Work

• Unnamed Item
• On the characterization and generation of nurse scheduling problem instances
• Propagation algorithms for lexicographic ordering constraints
• On the Desirability of Acyclic Database Schemes
• Encodings of the Sequence Constraint
• On Matrices, Automata, and Double Counting
• Modeling the Regular Constraint with Integer Programming
• Sequencing and Counting with the multicost-regular Constraint
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: On matrices, automata, and double counting in constraint programming