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

From MaRDI portal
Revision as of 04:52, 2 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2137960
Language Label Description Also known as
English
A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
scientific article; zbMATH DE number 2137960

    Statements

    A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    network flows
    0 references
    minimum cost flows
    0 references
    linear programming
    0 references
    shortest paths
    0 references
    medical applications
    0 references
    radiation therapy
    0 references