A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy (Q4651938): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:28, 7 February 2024
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
23 February 2005
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
