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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20047 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4254913749 / rank | |||
Normal rank | |||
Revision as of 01:56, 20 March 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
