Skip to main content
SpringerLink
Log in

Greedy and Exact Algorithms for Invitation Planning in Cancer Screening

  • Chapter
Book cover New Challenges in Applied Intelligence Technologies

Part of the book series: Studies in Computational Intelligence ((SCI,volume 134))

  • 671 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, R., Atherill, P.: Improving appointment scheduling for medical screening. IMA Journal of Management Mathematics 13, 225–243 (2002)

    Article  MATH  Google Scholar 

  2. Cervical cancer screening in the Emilia Romagna region of Italy, http://www.regione.emilia-romagna.it/screening/

  3. Ho, C.J., Lau, H.S.: Minimising total cost in scheduling outpatient appointments. Management Sci. 38, 1750–1764 (1992)

    Article  MATH  Google Scholar 

  4. Puget, J.F.: On the satisfiability of symmetrical constraint satisfaction problems. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, pp. 350–361. Springer, Heidelberg (1993)

    Google Scholar 

  5. Rohleder, T.R., Klassen, K.J.: Using client-variance information to improve dynamic appointment scheduling performance. Omega 28(10), 293–302 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Engineering, University of Ferrara, Via Saragat, 1, 44100, Ferrara, Italy

    Marco Gavanelli, Sergio Storari & Luca Tagliavini

  2. DEIS, University of Bologna, Viale Risorgimento, 2, 40136, Bologna, Italy

    Michela Milano

  3. Department of Public Health, Sanitary Agency of Bologna, Via Montebello, 6, 40136, Bologna, Italy

    Paola Baldazzi & Marilena Manfredi

  4. NOEMALIFE SpA, Via Gobetti, 52, 40129, Bologna, Italy

    Gianfranco Valastro

Authors
  1. Marco Gavanelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michela Milano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sergio Storari
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Luca Tagliavini
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Paola Baldazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Marilena Manfredi
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Gianfranco Valastro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ngoc Thanh Nguyen Radoslaw Katarzyniak

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gavanelli, M. et al. (2008). Greedy and Exact Algorithms for Invitation Planning in Cancer Screening. In: Nguyen, N.T., Katarzyniak, R. (eds) New Challenges in Applied Intelligence Technologies. Studies in Computational Intelligence, vol 134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79355-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79355-7_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79354-0

  • Online ISBN: 978-3-540-79355-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation