“…9 Hence, the BAS problem is usually formulated as a combinatorial optimization (CO) problem, i.e., the selection of an ensemble with η beams from a discrete set of |B| candidate beams. This combinatorial BAS problem may be solved efficiently with metaheuristics for CO-like simulated annealing, 3,5,10 genetic algorithms, 6,11,12 swarm algorithms, 13,14 and mixed integer programming 15,16 or with iterative strategies. 7,15,17,18 Independent BAS strategies, in contrast, exploit prior knowledge that may be based on geometric 8,19,20 or dosimetric 2,21,22 considerations to select a beam ensemble before the FO.…”