Optimization

Efficiently identifying critical nodes in large complex networks
The critical node detection problem (CNDP) aims to fragment a graph G=(V,E) by removing a set of vertices R with cardinality |R|≤k, …
Cite DOI
Interactive visual guidance for automated stereotactic radiosurgery treatment planning
The growing technology industry has led to the steady enhancement of expert systems, often at the cost of increased complexity for the …
Cite DOI
Network robustness versus multi-strategy sequential attack
We examine the robustness of networks under attack when the attacker sequentially selects from a number of different attack strategies, …
Cite DOI
Skeletonization for isocentre selection in Gamma Knife® Perfexion™
Gamma Knife® Perfexion™ (PFX) is used for delivering radiosurgery plans to treat lesions and tumours in the brain by means of …
Cite DOI
The Operations Research Revolution
The TutORials track at INFORMS is designed to give experts in the operations research and management science fields an expanded forum …
PDF Cite DOI
A derandomized approximation algorithm for the critical node detection problem
In this paper we propose an efficient approximation algorithm for determining solutions to the critical node detection problem (CNDP) …
Cite DOI
A fast greedy algorithm for the critical node detection problem
Cite
A fluence map optimization model for restoring traditional fractionation in IMRT treatment planning
One of the core problems in intensity modulated radiation therapy (IMRT) treatment planning is the fluence map optimization (FMO) …
Cite DOI
A randomized algorithm with local search for containment of pandemic disease spread
In this paper we present a randomized rounding algorithm for approximating the cardinality-constrained critical node detection problem. …
Cite DOI
A region growing algorithm for detecting critical nodes
Cite