A note on improving the performance of approximation algorithms for radiation therapy

[1]  Barry O'Sullivan,et al.  Hybrid Methods for the Multileaf Collimator Sequencing Problem , 2010, CPAIOR.

[2]  Z. Caner Taskin,et al.  Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning , 2010, Oper. Res..

[3]  Stephane Durocher,et al.  Fixed-Parameter Tractability and Improved Approximations for Segment Minimization , 2009, ArXiv.

[4]  Thomas Kalinowski The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence , 2009, Discret. Appl. Math..

[5]  Horst W. Hamacher,et al.  A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators , 2009, INFORMS J. Comput..

[6]  Sebastian Brand The sum-of-increments constraint in the consecutive-ones matrix decomposition problem , 2009, SAC '09.

[7]  Natashia Boland,et al.  Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators , 2009, Comput. Oper. Res..

[8]  W. Pribitkin Simple upper bounds for partition functions , 2009 .

[9]  Karl Otto,et al.  Volumetric modulated arc therapy: IMRT in a single gantry arc. , 2007, Medical physics.

[10]  Peter J. Stuckey,et al.  Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches , 2007, CPAIOR.

[11]  Maxwell Young,et al.  Approximation algorithms for minimizing segments in radiation therapy , 2007, Inf. Process. Lett..

[12]  Maxwell Young,et al.  Nonnegative integral subset representations of integer sets , 2007, Inf. Process. Lett..

[13]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[14]  Baruch Schieber,et al.  Minimizing Setup and Beam-On Times in Radiation Therapy , 2006, APPROX-RANDOM.

[15]  Gerhard J. Woeginger,et al.  Decomposition of integer matrices and multileaf collimator sequencing , 2005, Discret. Appl. Math..

[16]  Konrad Engel,et al.  A new algorithm for optimal multileaf collimator field segmentation , 2005, Discret. Appl. Math..

[17]  Davaatseren Baatar Matrix Decomposition with Times and Cardinality Objectives: Theory, Algorithms and Application to Multileaf Collimator Sequencing , 2005 .

[18]  R. Ahuja,et al.  A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy , 2005 .

[19]  Xiaobo Sharon Hu,et al.  Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy , 2006, Int. J. Comput. Geom. Appl..

[20]  Horst W. Hamacher,et al.  Minimizing beam‐on time in cancer radiation treatment using multileaf collimators , 2004, Networks.

[21]  C. Cotrutz,et al.  Segment-based dose optimization using a genetic algorithm. , 2003, Physics in medicine and biology.

[22]  J. Dai,et al.  Minimizing the number of segments in a delivery sequence for intensity-modulated radiation therapy with a multileaf collimator. , 2001, Medical physics.

[23]  Reuven Bar-Yehuda,et al.  A unified approach to approximating resource allocation and scheduling , 2001, JACM.

[24]  R. Siochi,et al.  Minimizing static intensity modulation delivery time using an intensity solid paradigm. , 1999, International journal of radiation oncology, biology, physics.

[25]  P. Xia,et al.  Multileaf collimator leaf sequencing algorithm for intensity modulated beams with multiple static segments. , 1998, Medical physics.

[26]  T. Bortfeld,et al.  X-ray field compensation with multileaf collimators. , 1994, International journal of radiation oncology, biology, physics.