In this paper, we demonstrate that designing a PAT plan through algorithmic methods is a NP-hard problem (in fact, NP-complete), where the problem size is determined by the number of discrete irradiation angles from which the radiation can be delivered.
Feb 20, 2024 · The hardness of the proton arc optimization problem is attributed to the energy sequencing constraint. •. A reduction from the vertex cover ...
People also ask
What are the negatives of proton therapy?
What is the success rate of proton therapy?
Why is proton therapy not covered by insurance?
What is the average cost of proton therapy for prostate cancer?
The proton arc therapy treatment planning problem is NP-Hard. · V. Wase, Sophie Wuyckens, +1 author. Michael Saint-Guillain · Published in Computers in Biology ...
In this paper, we demonstrate that designing a PAT plan through algorithmic methods is a NP-hard problem (in fact, NP-complete), where the problem size is ...
Jan 14, 2024 · Arc proton therapy (ArcPT) is an emerging modality in cancer treatments. It delivers the proton beams following a sequence of irradiation ...
The proton arc therapy treatment planning problem is NP-Hard. Proton arc therapy (PAT) is an advanced radiotherapy technique using charged particles in which ...
Feb 2, 2023 · Minimizing the number of nonzeroes of the solution (its l0-norm) is a difficult nonconvex and non-deterministic polynomial-time hardness (NP ...
A treatment plan comprehends the set of instructions needed to perform the treatment. It is obtained by formulating the treatment as an optimization problem ...
... problem is in NP). 6.3.3. Large Neighborhood Search. NP-hard or not, preliminary experiments showed that the ArcPT treatment optimization problem remains ...
