An exact method for the minimum cardinality problem in the treatment planning of intensity-modulated radiotherapy

INFORMS Journal on Computing

Volumn 21, Issue 4, 2009, Pages 562-574

  Ernst, Andreas T ^a   Mak, Vicky H ^b   Mason, Luke R ^b  

^a CSIRO   (Australia)

^b DEAKIN UNIVERSITY   (Australia)

Author keywords

Combinatorics; Health care; Mathematics; Treatment

Indexed keywords

EID: 70449469240     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0308     Document Type: Article

References (14)

1. Ahuja, R. K., H. W. Hamacher. 2005. A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy. Networks 45(1) 36-41.
2. Baatar, D., N. Boland, S. Brand, P. J. Stuckey. 2007. Minimum cardinality matrix decomposition into consecutive-ones matrices: CP and IP approaches. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lecture Notes in Computer Science, Vol.4510. Springer, Berlin, 1-15.
3. Baatar, D., H. W. Hamacher, M. Ehrgott, G. J. Woeginger. 2005. Decomposition of integer matrices and multileaf collimator sequencing. Discrete Appl. Math. 152(1-3) 6-34.
4. Bansal, N., D. Coppersmith, B. Schieber. 2006. Minimizing setup and beam-on times in radiation therapy. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science, Vol.4110. Springer, Berlin, 27-38.
5. Collins, M. J., D. Kempe, J. Saia, M. Young. 2007. Nonnegative integral subset representations of integer sets. Inform. Processing Lett. 101(3) 129-133.
6. Ehrgott, M., H. W. Hamacher, M. Nubaum. 2008. Decomposition of matrices and static multileaf collimators: Asurvey. C. J. S. Alves, P. M. Pardalos, L. N. Vicente, eds. Optimization in Medicine. Springer Optimization and Its Applications, Vol.12. Springer, New York, 25-46.
7. Engel, K. 2005. Anew algorithm for optimal multileaf collimator field segmentation. Discrete Appl. Math. 152(1-3) 35-51.
8. Kalinowski, T. 2004. Algorithmic complexity of the minimization of the number of segments in multileaf collimator field segmentation. Technical report, Department of Mathematics, University of Rostock, Rostock, Germany.
9. Langer, M., V. Thai, L. Papiez. 2001. Improved leaf sequencing reduces segments or monitor units needed to deliver IMRT using multileaf collimators. Medical Phys. 28(12) 2450-2458.
10. Luan, S., J. Saia, M. Young. 2007. Approximation algorithms for minimizing segments in radiation therapy. Inform. Processing Lett. 101(6) 239-244.
11. Mak, V. 2007. Iterative variable aggregation and disaggregation in IP: An application. Oper. Res. Lett. 35(1) 36-44.
12. Nubaum, M. 2006. Min cardinality C1-decomposition of integer matrices. Master's thesis, Department of Mathematics, Technical University of Kaiserslautern, Kaiserslautern, Germany.
13. Taşkin, Z. C., J. C. Smith, H. E. Romeijn, J. F. Dempsey. 2007. Optimal multileaf collimator leaf sequencing in IMRT treatment planning. Retrieved September 19, 2008, http://www.ise.ufl.edu/cole/Papers/imrt- unconstrained.pdf.
14. Xia, P., L. J. Verhey. 1998. Multileaf collimator leaf sequencing algorithm for intensity modulated beams with multiple static segments. Medical Phys. 25(8) 1424-1434.