Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

SAC
2009
ACM

favoriteEmaildiscussreport

76views Applied Computing» more SAC 2009»

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

13 years 11 months ago

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

Download ww2.cs.mu.oz.au

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

Real-time Traffic

Applied Computing | Cancer Radiotherapy Delivery | Constraint Programming Approach | Positive Linear Combination | SAC 2009 |

claim paper

Related Content

» Hybrid Methods for the Multileaf Collimator Sequencing Problem

» A Shortest PathBased Approach to the Multileaf Collimator Sequencing Problem

» Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulat...

» Cyclical scheduling and multishift scheduling Complexity and approximation algorithms

» Optimal Factorization of ThreeWay Binary Data

» Nonnegative matrix factorization with sparseness constraints

» Heteroscedastic Regression in Computer Vision Problems with Bilinear Constraint

» Penalty Decomposition Methods for Rank Minimization

» Computing the nonnegative 3way tensor factorization using Tikhonov regularization

Post Info
More Details (n/a)

Added	19 May 2010
Updated	19 May 2010
Type	Conference
Year	2009
Where	SAC
Authors	Sebastian Brand

Comments (0)