Sciweavers

Share
SAC
2009
ACM

The sum-of-increments constraint in the consecutive-ones matrix decomposition problem

9 years 7 months ago
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
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
Sebastian Brand
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where SAC
Authors Sebastian Brand
Comments (0)
books