Cancer screening is a method of preventing cancer by early detecting and treating abnormalities. One of the most critical screening phase is invitation planning since screening resources are limited and there are many people to invite. For this reason, smart resource allocation approaches are needed. In the paper, we propose and compare two solutions for smart invitation plan definition, one based on greedy approaches and one based on Constraint Programming techniques that enable the definition of the optimal invitation plan.
M. Gavanelli, M. Milano, S. Storari, L. Tagliavini, P. Baldazzi, M. Manfredi, et al. (2008). Greedy and Exact Algorithms for Invitation Planning in Cancer Screening.. HEIDELBERG : Springer [10.1007/978-3-540-79355-7_25].
Greedy and Exact Algorithms for Invitation Planning in Cancer Screening.
MILANO, MICHELA;
2008
Abstract
Cancer screening is a method of preventing cancer by early detecting and treating abnormalities. One of the most critical screening phase is invitation planning since screening resources are limited and there are many people to invite. For this reason, smart resource allocation approaches are needed. In the paper, we propose and compare two solutions for smart invitation plan definition, one based on greedy approaches and one based on Constraint Programming techniques that enable the definition of the optimal invitation plan.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
