A K-adaptability clustering heuristic for discrete-uncertainty robust optimization improves worst-case CTV Dmin in proton therapy by up to 4.52 Gy on average versus conventional robust planning, with a proof that the continuous-variable problem is NP-hard.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A K-adaptability Approach to Proton Radiation Therapy Robust Treatment Planning
A K-adaptability clustering heuristic for discrete-uncertainty robust optimization improves worst-case CTV Dmin in proton therapy by up to 4.52 Gy on average versus conventional robust planning, with a proof that the continuous-variable problem is NP-hard.