CP and IP approaches to cancer radiotherapy delivery optimization

DOI10.1007/s10601-010-9104-1zbMath1213.90271OpenAlexW2066960828MaRDI QIDQ538316

Sebastian Brand, Davaatseren Baatar, Natashia Boland, Peter J. Stuckey

Publication date: 25 May 2011

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-010-9104-1

zbMATH Keywords

integer programmingmodellingsearchintensity-modulated radiation therapysymmetry-breakingmultileaf collimator leaf sequencing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Medical applications (general) (92C50)

Related Items

Comparing optimization methods for radiation therapy patient scheduling using different objectives, Search combinators, An integer linear programming formulation for the minimum cardinality segmentation problem

Cites Work

• Inverse radiation therapy planning -- a multiple objective optimization approach
• Decomposition of integer matrices and multileaf collimator sequencing
• A new algorithm for optimal multileaf collimator field segmentation
• A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint
• Iterative variable aggregation and disaggregation in IP: an application
• An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy
• Minimizing Setup and Beam-On Times in Radiation Therapy
• Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
• A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
• Mountain reduction, block matching, and applications in intensity-modulated radiation therapy
• Mathematical optimization in intensity modulated radiation therapy