Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/26778
Title: A Minimum Cost Flow Formulation for Approximated MLC Segmentation
Contributor(s): Kalinowski, Thomas  (author)orcid 
Publication Date: 2011-03
Early Online Version: 2011-02-11
DOI: 10.1002/net.20394
Handle Link: https://hdl.handle.net/1959.11/26778
Abstract: Shape matrix decomposition is a sub-problem in radiation therapy planning. A given fluence matrix has to be written as a sum of shape matrices corresponding to homogeneous fields that can be shaped by a multileaf collimator. We solve the problem of finding an approximation of satisfying prescribed upper and lower bounds for each entry. The approximation is determined such that the corresponding fluence can be realized with a prescribed delivery time using a multileaf collimator with an interleaf collision constraint, and under this condition the distance between and is minimized.
Publication Type: Journal Article
Source of Publication: Networks, 57(2), p. 135-140
Publisher: John Wiley & Sons, Inc
Place of Publication: United States of America
ISSN: 1097-0037
0028-3045
Fields of Research (FoR) 2008: 010303 Optimisation
010206 Operations Research
Fields of Research (FoR) 2020: 490304 Optimisation
490108 Operations research
Socio-Economic Objective (SEO) 2008: 970101 Expanding Knowledge in the Mathematical Sciences
Socio-Economic Objective (SEO) 2020: 280118 Expanding knowledge in the mathematical sciences
Peer Reviewed: Yes
HERDC Category Description: C1 Refereed Article in a Scholarly Journal
Appears in Collections:Journal Article
School of Science and Technology

Files in This Item:
1 files
File SizeFormat 
Show full item record

SCOPUSTM   
Citations

1
checked on Apr 6, 2024

Page view(s)

1,314
checked on Mar 8, 2023
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.