A minimum cost flow formulation for approximated MLC segmentation

DOI10.1002/NET.20394MaRDI QIDQ3082602zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Thomas Kalinowski

Publication date 16 March 2011

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

intensity modulated radiation therapymultileaf collimator

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90)

Recommendations

• Approximated MLC shape matrix decomposition with interleaf collision constraint
• The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
• Approximated matrix decomposition for IMRT planning with multileaf collimators
• Minimizing beam-on time in cancer radiation treatment using multileaf collimators
• Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition

Cites work

• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint
• Approximated MLC shape matrix decomposition with interleaf collision constraint
• Approximated matrix decomposition for IMRT planning with multileaf collimators
• Decomposition of integer matrices and multileaf collimator sequencing

Cited in

(3)

• A function approximation approach to the segmentation step in IMRT planning
• Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition
• Approximated MLC shape matrix decomposition with interleaf collision constraint

This page was built for publication: A minimum cost flow formulation for approximated MLC segmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082602)