User menu

An integer linear programming formulation for the minimum cardinality segmentation problem

Bibliographic reference Catanzaro, Daniele ; Engelbeen, C.. An integer linear programming formulation for the minimum cardinality segmentation problem. In: Algorithms, Vol. 8, no.4, p. 999-1020 (2015)
Permanent URL http://hdl.handle.net/2078.1/175079
  1. Baatar Davaatseren, Hamacher Horst W., Ehrgott Matthias, Woeginger Gerhard J., Decomposition of integer matrices and multileaf collimator sequencing, 10.1016/j.dam.2005.04.008
  2. Biedl Therese, Durocher Stephane, Engelbeen Céline, Fiorini Samuel, Young Maxwell, Faster optimal algorithms for segment minimization with small maximal value, 10.1016/j.dam.2012.09.011
  3. Takahashi, Acta Radiol. Suppl., 242, 1 (1965)
  4. Brewster Linda, Mohan Radhe, Mageras Gig, Burman Chandra, Leibel Steven, Fuks Zvi, Three dimensional conformal treatment planning with multileaf collimators, 10.1016/0360-3016(95)02061-6
  5. Helyer S.J., Heisig S., Multileaf collimation versus conventional shielding blocks: a time and motion study of beam shaping in radiotherapy, 10.1016/0167-8140(95)01616-o
  6. Bucci M. K., Bevan A., Roach M., Advances in Radiation Therapy: Conventional to 3D, to IMRT, to 4D, and Beyond, 10.3322/canjclin.55.2.117
  7. Ehrgott Matthias, Güler Çiğdem, Hamacher Horst W., Shao Lizhen, Mathematical optimization in intensity modulated radiation therapy, 10.1007/s10288-008-0083-7
  8. Collins Michael J., Kempe David, Saia Jared, Young Maxwell, Nonnegative integral subset representations of integer sets, 10.1016/j.ipl.2006.08.007
  9. Ernst Andreas T., Mak Vicky H., Mason Luke R., An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy, 10.1287/ijoc.1080.0308
  10. Engel Konrad, A new algorithm for optimal multileaf collimator field segmentation, 10.1016/j.dam.2004.10.007
  11. Kalinowski, 1 (2004)
  12. Cambazard Hadrien, O’Mahony Eoin, O’Sullivan Barry, A shortest path-based approach to the multileaf collimator sequencing problem, 10.1016/j.dam.2011.09.008
  13. Langer Mark, Thai Van, Papiez Lech, Improved leaf sequencing reduces segments or monitor units needed to deliver IMRT using multileaf collimators, 10.1118/1.1420392
  14. Baatar Davaatseren, Boland Natashia, Brand Sebastian, Stuckey Peter J., CP and IP approaches to cancer radiotherapy delivery optimization, 10.1007/s10601-010-9104-1
  15. Mak Vicky, Iterative variable aggregation and disaggregation in IP: An application, 10.1016/j.orl.2006.01.008
  16. Wake Giulia M.G.H., Boland Natashia, Jennings Les S., Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators, 10.1016/j.cor.2007.10.027
  17. Andrews (1976)
  18. Ahuja (1993)
  19. Martin (1999)
  20. MCSPperso.uclouvain.be/ daniele.catanzaro/SupportingMaterial/MCSP.zip
  21. Fischetti Matteo, Lancia Giuseppe, Serafini Paolo, Exact algorithms for minimum routing cost trees, 10.1002/net.10022
  22. Matsumoto Makoto, Nishimura Takuji, Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator, 10.1145/272991.272995
  23. Matsumoto Makoto, Kurita Yoshiharu, Twisted GFSR generators, 10.1145/146382.146383