메뉴 건너뛰기




Volumn 40, Issue 9, 2013, Pages 2178-2186

Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures

Author keywords

Combinatorial Benders decomposition; IMRT; Matrix segmentation by rectangles; Mixed integer programming

Indexed keywords

BENDERS DECOMPOSITION; IMRT; INTENSITY PROFILES; INTENSITY-MODULATED RADIATION THERAPY; MATRIX DECOMPOSITION; MIXED-INTEGER PROGRAMMING; MULTILEAF COLLIMATORS; RECTANGULAR APERTURE;

EID: 84877837802     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.07.005     Document Type: Article
Times cited : (22)

References (44)
  • 1
    • 11844276083 scopus 로고    scopus 로고
    • A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
    • R.K. Ahuja, and H.W. Hamacher A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy Networks 45 2005 36 41
    • (2005) Networks , vol.45 , pp. 36-41
    • Ahuja, R.K.1    Hamacher, H.W.2
  • 3
    • 37149027934 scopus 로고    scopus 로고
    • Minimum cardinality matrix decomposition into consecutive ones matrices: CP and IP approaches
    • D. Baatar, N. Boland, S. Brand, and P.J. Stuckey Minimum cardinality matrix decomposition into consecutive ones matrices: CP and IP approaches Lecture Notes in Computer Science 4510 2007 1 15
    • (2007) Lecture Notes in Computer Science , vol.4510 , pp. 1-15
    • Baatar, D.1    Boland, N.2    Brand, S.3    Stuckey, P.J.4
  • 4
    • 73649130965 scopus 로고    scopus 로고
    • Combinatorial Benders cuts for minimum tollbooth problem
    • L. Bai, and P.A. Rubin Combinatorial Benders cuts for minimum tollbooth problem Operations Research 57 2009 1510 1522
    • (2009) Operations Research , vol.57 , pp. 1510-1522
    • Bai, L.1    Rubin, P.A.2
  • 6
    • 0346452791 scopus 로고    scopus 로고
    • Fast heuristics for the maximum feasible subsystem problem
    • J.W. Chinneck Fast heuristics for the maximum feasible subsystem problem INFORMS Journal on Computing 13 2001 210 223
    • (2001) INFORMS Journal on Computing , vol.13 , pp. 210-223
    • Chinneck, J.W.1
  • 7
    • 33749477567 scopus 로고    scopus 로고
    • Combinatorial Benders cuts for mixed-integer linear programming
    • G. Codato, and M. Fischetti Combinatorial Benders cuts for mixed-integer linear programming Operations Research 54 2006 756 766
    • (2006) Operations Research , vol.54 , pp. 756-766
    • Codato, G.1    Fischetti, M.2
  • 8
    • 69749116580 scopus 로고    scopus 로고
    • The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
    • C.E. Cortes, M. Matamala, and C. Contardo The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method European Journal of Operational Research 200 2005 711 724
    • (2005) European Journal of Operational Research , vol.200 , pp. 711-724
    • Cortes, C.E.1    Matamala, M.2    Contardo, C.3
  • 9
    • 0033407585 scopus 로고    scopus 로고
    • Intensity-modulation radiotherapy using independent collimators: An algorithm study
    • J. Dai, and Y. Hu Intensity-modulation radiotherapy using independent collimators: an algorithm study Medical Physics 26 3 1999 2562 2570
    • (1999) Medical Physics , vol.26 , Issue.3 , pp. 2562-2570
    • Dai, J.1    Hu, Y.2
  • 11
    • 26444478195 scopus 로고    scopus 로고
    • A new algorithm for optimal multileaf collimator field segmentation
    • K. Engel A new algorithm for optimal multileaf collimator field segmentation Discrete Applied Mathematics 152 2005 35 51
    • (2005) Discrete Applied Mathematics , vol.152 , pp. 35-51
    • Engel, K.1
  • 12
    • 67349157216 scopus 로고    scopus 로고
    • Optimal matrix-segmentation by rectangles
    • K. Engel Optimal matrix-segmentation by rectangles Discrete Applied Mathematics 157 2009 2015 2030
    • (2009) Discrete Applied Mathematics , vol.157 , pp. 2015-2030
    • Engel, K.1
  • 13
    • 78650779297 scopus 로고    scopus 로고
    • Approximated matrix decomposition for IMRT planning with multileaf collimators
    • K. Engel, and A. Kiesel Approximated matrix decomposition for IMRT planning with multileaf collimators OR Spectrum 33 2011 149 172
    • (2011) OR Spectrum , vol.33 , pp. 149-172
    • Engel, K.1    Kiesel, A.2
  • 14
    • 70449469240 scopus 로고    scopus 로고
    • An exact method for the minimum cardinality problem in the treatment planning of intensity-modulated radiotherapy
    • A.T. Ernst, V.H. Mak, and L.R. Mason An exact method for the minimum cardinality problem in the treatment planning of intensity-modulated radiotherapy INFORMS Journal on Computing 21 2009 562 574
    • (2009) INFORMS Journal on Computing , vol.21 , pp. 562-574
    • Ernst, A.T.1    Mak, V.H.2    Mason, L.R.3
  • 15
    • 0019477279 scopus 로고
    • The Lagrangian relaxation method for solving integer programming problems
    • M.L. Fisher The Lagrangian relaxation method for solving integer programming problems Management Science 27 1981 1 18
    • (1981) Management Science , vol.27 , pp. 1-18
    • Fisher, M.L.1
  • 16
    • 0347278771 scopus 로고
    • Identifying minimally infeasible subsystem of inequalities
    • J. Gleeson, and J. Ryan Identifying minimally infeasible subsystem of inequalities ORSA Journal on Computing 2 4 1990 61 64
    • (1990) ORSA Journal on Computing , vol.2 , Issue.4 , pp. 61-64
    • Gleeson, J.1    Ryan, J.2
  • 17
    • 0007993386 scopus 로고    scopus 로고
    • Analyzing infeasible mixed-integer and integer linear programs
    • O. Guieu, and J.W. Chinneck Analyzing infeasible mixed-integer and integer linear programs INFORMS Journal on Computing 11 1999 63 77
    • (1999) INFORMS Journal on Computing , vol.11 , pp. 63-77
    • Guieu, O.1    Chinneck, J.W.2
  • 18
    • 84877836170 scopus 로고    scopus 로고
    • IBM ILOG CPLEX 12.2: User's manual. International Business Machines Corporation; 2009
    • IBM ILOG CPLEX 12.2: User's manual. International Business Machines Corporation; 2009.
  • 19
    • 67349133147 scopus 로고    scopus 로고
    • The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
    • T. Kalinowski 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 157 2009 2089 2104
    • (2009) Discrete Applied Mathematics , vol.157 , pp. 2089-2104
    • Kalinowski, T.1
  • 20
    • 68649083794 scopus 로고    scopus 로고
    • A dual of the rectangle-segmentation problem for binary matrices
    • T. Kalinowski A dual of the rectangle-segmentation problem for binary matrices The Electronic Journal of Combinatorics 16 1 2009
    • (2009) The Electronic Journal of Combinatorics , vol.16 , Issue.1
    • Kalinowski, T.1
  • 23
    • 34147144508 scopus 로고    scopus 로고
    • A feasibility study of using conventional jaws to deliver IMRT plans in the treatment of prostate cancer
    • Y. Kim, L.J. Verhey, and P. Xia A feasibility study of using conventional jaws to deliver IMRT plans in the treatment of prostate cancer Physics in Medicine and Biology 52 8 2007 2147 2156
    • (2007) Physics in Medicine and Biology , vol.52 , Issue.8 , pp. 2147-2156
    • Kim, Y.1    Verhey, L.J.2    Xia, P.3
  • 24
    • 0035660956 scopus 로고    scopus 로고
    • Improved leaf sequencing reduces segments or monitor units needed to deliver IMRT using multileaf collimators
    • M. Langer, V. Thai, and L. Papiez Improved leaf sequencing reduces segments or monitor units needed to deliver IMRT using multileaf collimators Medical Physics 28 2001 2450 2458
    • (2001) Medical Physics , vol.28 , pp. 2450-2458
    • Langer, M.1    Thai, V.2    Papiez, L.3
  • 25
    • 0034036573 scopus 로고    scopus 로고
    • Optimization of radiosurgery treatment planning via mixed integer programming
    • E.K. Lee, T. Fox, and I. Crocker Optimization of radiosurgery treatment planning via mixed integer programming Medical Physics 27 2000 995 1004
    • (2000) Medical Physics , vol.27 , pp. 995-1004
    • Lee, E.K.1    Fox, T.2    Crocker, I.3
  • 26
    • 0037248969 scopus 로고    scopus 로고
    • Integer programming applied to intensity-modulated radiation treatment planning
    • E.K. Lee, T. Fox, and I. Crocker Integer programming applied to intensity-modulated radiation treatment planning Annals of Operations Research 119 2003 165 181
    • (2003) Annals of Operations Research , vol.119 , pp. 165-181
    • Lee, E.K.1    Fox, T.2    Crocker, I.3
  • 27
    • 29344459455 scopus 로고    scopus 로고
    • Simultaneous beam geometry and intensity map optimization in intensity-modulated radiation therapy
    • E.K. Lee, T. Fox, and I. Crocker Simultaneous beam geometry and intensity map optimization in intensity-modulated radiation therapy International Journal of Radiation Oncology Biology Physics 64 2006 301 320
    • (2006) International Journal of Radiation Oncology Biology Physics , vol.64 , pp. 301-320
    • Lee, E.K.1    Fox, T.2    Crocker, I.3
  • 28
    • 2942612348 scopus 로고    scopus 로고
    • Automatic beam angle selection in IMRT planning using genetic algorithm
    • Y. Li, J. Yao, and D. Yao Automatic beam angle selection in IMRT planning using genetic algorithm Physics in Medicine and Biology 49 2004 1915 1932
    • (2004) Physics in Medicine and Biology , vol.49 , pp. 1915-1932
    • Li, Y.1    Yao, J.2    Yao, D.3
  • 29
    • 43049149408 scopus 로고    scopus 로고
    • Iterative solution methods for beam angle and fluence map optimization in intensity modulated radiation therapy planning
    • G.J. Lim, J. Choi, and R. Mohan Iterative solution methods for beam angle and fluence map optimization in intensity modulated radiation therapy planning OR Spectrum 30 2008 289 309
    • (2008) OR Spectrum , vol.30 , pp. 289-309
    • Lim, G.J.1    Choi, J.2    Mohan, R.3
  • 30
    • 36949021346 scopus 로고    scopus 로고
    • An exact approach to direct aperture optimization in IMRT treatment planning
    • C. Men, H.E. Romeijn, Z.C. Taşkin, and J.F. Dempsey An exact approach to direct aperture optimization in IMRT treatment planning Physics in Medicine and Biology 52 24 2007 7333 7352
    • (2007) Physics in Medicine and Biology , vol.52 , Issue.24 , pp. 7333-7352
    • Men, C.1    Romeijn, H.E.2    Taşkin, Z.C.3    Dempsey, J.F.4
  • 31
    • 71049159674 scopus 로고    scopus 로고
    • A feasibility study of using conventional jaws to deliver complex IMRT plans for head and neck cancer
    • G. Mu, and P. Xia A feasibility study of using conventional jaws to deliver complex IMRT plans for head and neck cancer Physics in Medicine and Biology 54 18 2009 5613 5623
    • (2009) Physics in Medicine and Biology , vol.54 , Issue.18 , pp. 5613-5623
    • Mu, G.1    Xia, P.2
  • 33
    • 21444451485 scopus 로고    scopus 로고
    • Finding the minimum weight IIS cover of an infeasible system of linear inequalities
    • M. Parker, and J. Ryan Finding the minimum weight IIS cover of an infeasible system of linear inequalities Annals of Mathematics and Artificial Intelligence 17 1996 107 126
    • (1996) Annals of Mathematics and Artificial Intelligence , vol.17 , pp. 107-126
    • Parker, M.1    Ryan, J.2
  • 34
    • 0034126575 scopus 로고    scopus 로고
    • Beam orientation optimization in intensity-modulated radiation treatment planning
    • A.B. Pugachev, A.L. Boyer, and L. Xing Beam orientation optimization in intensity-modulated radiation treatment planning Medical Physics 27 2000 1238 1245
    • (2000) Medical Physics , vol.27 , pp. 1238-1245
    • Pugachev, A.B.1    Boyer, A.L.2    Xing, L.3
  • 35
    • 56249085242 scopus 로고    scopus 로고
    • Intensity modulated radiation therapy treatment plan optimization
    • H.E. Romeijn, and J.F. Dempsey Intensity modulated radiation therapy treatment plan optimization TOP 16 2008 215 243
    • (2008) TOP , vol.16 , pp. 215-243
    • Romeijn, H.E.1    Dempsey, J.F.2
  • 36
    • 33645558757 scopus 로고    scopus 로고
    • A new linear programming approach to radiation therapy treatment planning problems
    • H.E. Romeijn, R.K. Ahuja, J.F. Dempsey, and A. Kumar A new linear programming approach to radiation therapy treatment planning problems Operations Research 54 2006 201 216
    • (2006) Operations Research , vol.54 , pp. 201-216
    • Romeijn, H.E.1    Ahuja, R.K.2    Dempsey, J.F.3    Kumar, A.4
  • 37
    • 77956909253 scopus 로고    scopus 로고
    • A nested Benders decomposition approach for telecommunication network planning
    • J.N. Sawaya, and S. Elhedhli A nested Benders decomposition approach for telecommunication network planning Naval Research Logistics 57 2010 519 539
    • (2010) Naval Research Logistics , vol.57 , pp. 519-539
    • Sawaya, J.N.1    Elhedhli, S.2
  • 38
    • 0033012850 scopus 로고    scopus 로고
    • Minimizing static intensity modulation delivery time using an intensity solid paradigm
    • R.A.C. Siochi Minimizing static intensity modulation delivery time using an intensity solid paradigm International Journal of Radiation Oncology Biology Physics 43 6 1999 671 680
    • (1999) International Journal of Radiation Oncology Biology Physics , vol.43 , Issue.6 , pp. 671-680
    • Siochi, R.A.C.1
  • 39
    • 84863198267 scopus 로고    scopus 로고
    • Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
    • in press
    • Taşkin ZC, Smith JC, Romeijn HE. Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures. Annals of Operations Research, in press. doi:10.1007/s10479-010-0767-1
    • Annals of Operations Research
    • Taşkin Zc, S.1
  • 40
    • 77953589447 scopus 로고    scopus 로고
    • Optimal multileaf collimator leaf sequencing in IMRT treatment planning
    • Z.C. Taşkin, J.C. Smith, H.E. Romeijn, and J.F. Dempsey Optimal multileaf collimator leaf sequencing in IMRT treatment planning Operations Research 58 3 2010 674 690
    • (2010) Operations Research , vol.58 , Issue.3 , pp. 674-690
    • Taşkin, Z.C.1    Smith, J.C.2    Romeijn, H.E.3    Dempsey, J.F.4
  • 41
    • 77953870839 scopus 로고    scopus 로고
    • IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
    • M.W. Tanner, and L. Ntaimo IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation European Journal of Operational Research 207 2010 290 296
    • (2010) European Journal of Operational Research , vol.207 , pp. 290-296
    • Tanner, M.W.1    Ntaimo, L.2
  • 42
    • 53749099071 scopus 로고    scopus 로고
    • Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators
    • G.M.G.H. Wake, N. Boland, and L.S. Jenningsa Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators Computers & Operations Research 36 2009 795 810
    • (2009) Computers & Operations Research , vol.36 , pp. 795-810
    • Wake, G.M.G.H.1    Boland, N.2    Jenningsa, L.S.3
  • 43
    • 0031868367 scopus 로고    scopus 로고
    • Multileaf collimator leaf sequencing algorithm for intensity modulated beams with multiple static segments
    • P. Xia, and L.J. Verhey Multileaf collimator leaf sequencing algorithm for intensity modulated beams with multiple static segments Medical Physics 25 8 1998 1424 1434
    • (1998) Medical Physics , vol.25 , Issue.8 , pp. 1424-1434
    • Xia, P.1    Verhey, L.J.2
  • 44
    • 67649088397 scopus 로고    scopus 로고
    • Dynamic delivery of IMRT using an independent collimator: A model study
    • Y. Zhang, Y. Hu, L. Ma, and J. Dai Dynamic delivery of IMRT using an independent collimator: a model study Physics in Medicine and Biology 54 8 2009 2527 2539
    • (2009) Physics in Medicine and Biology , vol.54 , Issue.8 , pp. 2527-2539
    • Zhang, Y.1    Hu, Y.2    Ma, L.3    Dai, J.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.