ACM Home Page
Please provide us with feedback. Feedback
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
Full text PdfPdf (262 KB)
Source
Symposium on Applied Computing archive
Proceedings of the 2009 ACM symposium on Applied Computing table of contents
Honolulu, Hawaii
POSTER SESSION: Poster papers table of contents
Pages 1417-1418  
Year of Publication: 2009
ISBN:978-1-60558-166-8
Author
Sebastian Brand  University of Melbourne, Australia
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 21,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1529282.1529599
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
S. Webb. Intensity modulated radiation therapy. In Institute of Physics Publishing Bristol and Philadelphia, 2001.