morLAB
morLAB
Research
People
Publications
Contact
Light
Dark
Automatic
Networks
A branch-and-price algorithm enhanced by decision diagrams for the kidney exchange problem
Problem definition: Kidney paired donation programs allow patients registered with an incompatible donor to receive a suitable kidney …
Cite
DOI
Spatio-temporal clustering of multi-location time series to model seasonal influenza spread
Although seasonal influenza disease spread is a spatio-temporal phenomenon, public surveillance systems aggregate data only spatially, …
Cite
DOI
A feasibility look to two-stage robust optimization in kidney exchange
Kidney paired donation programs (KPDPs) are an alternative for patients whose non-ideal donors are willing to donate a kidney to …
PDF
Cite
Transplant matching and survival prediction
Matching pools of kidney patients to eligible donors and predicting survival of bone marrow and liver transplants using machine learning
Pandemic modeling and planning
Predicting pandemic disease spread through very large agent-based simulations and optimizing mitigation strategies through graph theory and machine learning
A branch-and-price algorithm enhanced by decision diagrams for the kidney exchange problem
Kidney paired donation programs allow patients registered with an incompatible donor to receive a suitable kidney from another donor, …
PDF
Cite
Deriving pandemic disease mitigation strategies by mining social contact networks
In this chapter we propose a robust approach to deriving disease mitigation strategies from contact networks that are generated from …
Cite
DOI
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
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
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
»
Cite
×