Revisiting the sequence constraint

  • Authors:
  • Willem-Jan van Hoeve;Gilles Pesant;Louis-Martin Rousseau;Ashish Sabharwal

  • Affiliations:
  • Department of Computer Science, Cornell University, Ithaca, NY;École Polytechnique de Montréal, Montreal, Canada;École Polytechnique de Montréal, Montreal, Canada;Department of Computer Science, Cornell University, Ithaca, NY

  • Venue:
  • CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a given width. To date, none of the filtering algorithms proposed guaranteed domain consistency. In this paper, we present three filtering algorithms for the sequence constraint, with complementary strengths. One borrows ideas from dynamic programming; another reformulates it as a regular constraint; the last is customized. The last two algorithms establish domain consistency. Our customized algorithm does so in polynomial time, and can even be applied to a generalized sequence constraint for subsequences of variable widths. Experimental results show the practical usefulness of each.