The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer radiotherapy delivery planning. A fast constraint programming approach for this problem exists. I present a propagation algorithm for a constraint in this approach that can speed up solving by an order of magnitude. Categories and Subject Descriptors