A shortest path-based approach to the multileaf collimator sequencing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5547 LNCS, Issue , 2009, Pages 41-55

  Cambazard, Hadrien ^a   O'Mahony, Eoin ^a   O'Sullivan, Barry ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY MATRIX; CANCER TREATMENT; CARDINALITIES; COMPLEX CONSTRUCTION; CONSECUTIVE ONES PROPERTY; CONSTRAINT PROGRAMMING MODEL; INTEGER MATRICES; MATRIX; MULTILEAF COLLIMATOR SEQUENCING; PROBLEM INSTANCES; REAL-WORLD; SHORTEST PATH; SHORTEST PATH PROBLEM; STRONGLY NP-HARD;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; MATRIX ALGEBRA;

CONSTRAINED OPTIMIZATION;

EID: 69849116046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01929-6_5     Document Type: Conference Paper

References (12)

1. Baatar, D., Boland, N., Brand, S., Stuckey, P.J.: Minimum cardinality matrix decomposition into consecutive-ones matrices: CP and IP approaches. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.4510, pp. 1-15. Springer, Heidelberg (2007)
2. Baatar, D., Hamacher, H.W., Ehrgott, M., Woeginger, G.J.: Decomposition of integer matrices and multileaf collimator sequencing. Discrete Applied Mathematics 152(1-3), 6-34 (2005)
3. Bahr, G.K., Kereiakes, J.G., Horwitz, H., Finney, R., Galvin, J., Goode, K.: The method of linear programming applied to radiation therapy planning. Radiology 91, 686-693 (1968)
4. Brand, S.: The sum-of-increments constraints in the consecutive-ones matrix decomposition problem. In: SAC 2009: 24th Annual ACM Symposium on Applied Computing (2009)
5. Burkard, R.E.: Open problem session. In: Oberwolfach Conference on Combinatorial Optimization (November 2002)
6. Engel, K.: A new algorithm for optimal multileaf collimator field segmentation. Discrete Applied Mathematics 152(1-3), 35-51 (2005)
7. Gellermann, T., Sellmann, M., Wright, R.: Shorter path constraints for the resource constrained shortest path problem. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.3524, pp. 201-216. Springer, Heidelberg (2005)
8. Hamacher, H.W., Ehrgott, M.: Special section: Using discrete mathematics to model multi-leaf collimators in radiation therapy. Discrete Applied Mathematics 152(1-3), 4-5 (2005)
9. Kalinowski, T.: The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence. Discrete Applied Mathematics (in press)
10. Maher, M.J.: Analysis of a global contiguity constraint. In: Workshop on Rule-Based Constraint Reasoning and Programming (2002)
11. Martin, D., Francois, S.: A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR 26(3), 191-212 (1988)
12. Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol.3258, pp. 482-495. Springer, Heidelberg (2004)