A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy

DOI10.1002/net.20047zbMath1061.92033OpenAlexW4254913749MaRDI QIDQ4651938

Horst W. Hamacher, Ravindra K. Ahuja

Publication date: 23 February 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20047

zbMATH Keywords

linear programming shortest paths network flows radiation therapy minimum cost flows medical applications

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Medical applications (general) (92C50) Basic linear algebra (15A99)

Related Items (28)

Comments on: Optimization and data mining in medicine ⋮ Iterative variable aggregation and disaggregation in IP: an application ⋮ Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures ⋮ Robust Direct Aperture Optimization for Radiation Therapy Treatment Planning ⋮ A closest vector problem arising in radiation therapy planning ⋮ Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy ⋮ Approximated matrix decomposition for IMRT planning with multileaf collimators ⋮ A function approximation approach to the segmentation step in IMRT planning ⋮ Minimum decomposition into convex binary matrices ⋮ A note on improving the performance of approximation algorithms for radiation therapy ⋮ MOUNTAIN REDUCTION, BLOCK MATCHING, AND APPLICATIONS IN INTENSITY-MODULATED RADIATION THERAPY ⋮ A new algorithm for a field splitting problem in intensity-modulated radiation therapy ⋮ On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model ⋮ Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators ⋮ Mathematical optimization in intensity modulated radiation therapy ⋮ Mathematical optimization in intensity modulated radiation therapy ⋮ Optimal matrix-segmentation by rectangles ⋮ Shape rectangularization problems in intensity-modulated radiation therapy ⋮ Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures ⋮ CP and IP approaches to cancer radiotherapy delivery optimization ⋮ A network approach for segmentation in intensity modulated arc therapy ⋮ Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy ⋮ Intensity modulated radiation therapy treatment plan optimization. With comments and rejoinder ⋮ Minimizing the number of apertures in multileaf collimator sequencing with field splitting ⋮ Quantifying the Trade-off Between IMRT Treatment Plan Quality and Delivery Efficiency Using Direct Aperture Optimization ⋮ A shortest path-based approach to the multileaf collimator sequencing problem ⋮ Decomposition of integer matrices and multileaf collimator sequencing ⋮ A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning

This page was built for publication: A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy