NETWORK OPTIMIZATION PROBLEM APPLICABLE FOR BREAST CANCER SCREENING COST MINIMIZATION

Authors

DOI:

https://doi.org/10.24193/subbi.2025.01

Keywords:

optimization, network, graph traversal, DBSCAN

Abstract

We investigate the problem of breast cancer screening optimization, using various techniques applicable in domains where the data format is not defined in advance. The aim is to minimize the cost related to the screening of patients while maximizing the beneficial effect of the process regarding some key breast cancer indices. Our model can be easily adjusted to other similar network optimization tasks where a goal function has to be minimized across a geographical surface. We present the problem’s key similarities to the Travelling Salesman Problem and underline the fact why we choose a deterministic algorithm compared to a Simulated Annealing-based solution. Furthermore, we present the usefulness of the Elastic Stack regarding this application and offer a concrete solution to the problem defined by our generated dataset, respecting the European data distributions in this domain.

2010 Mathematics Subject Classification. 91-04, 91-08.
1998 CR Categories and Descriptors. G.1.6 [Optimization]: Subtopic – Simulated annealing G.1.6 [Optimization]: Subtopic – Constrained optimization.

References

[1] Matthew Agostinelli. Density-based clustering heuristics for the traveling salesman problem. 2017.

[2] Omar Cheikhrouhou and Ines Khoufi. A comprehensive survey on the multiple traveling salesman problem: Applications, approaches and taxonomy. Computer Science Review, 40:100369, 2021.

[3] Ioannis Gkioulekas and Lazaros G Papageorgiou. Piecewise regression analysis through information criteria using mathematical programming. Expert Systems with Applications, 121:362–372, 2019.

[4] Kamran Khan, Saif Ur Rehman, Kamran Aziz, Simon Fong, and Sababady Sarasvady. Dbscan: Past, present and future. In The fifth international conference on the applications of digital information and web technologies (ICADIWT 2014), pages 232–238. IEEE, 2014.

[5] Hyune-Ju Kim, Michael P Fay, Eric J Feuer, and Douglas N Midthune. Permutation tests for joinpoint regression with applications to cancer rates. Statistics in medicine, 19(3):335–351, 2000.

[6] Wenhui Ren, Mingyang Chen, Youlin Qiao, and Fanghui Zhao. Global guidelines for breast cancer screening: a systematic review. The Breast, 64:85–99, 2022.

[7] Adam Yala, Peter G Mikhael, Constance Lehman, Gigin Lin, Fredrik Strand, Yung-Liang Wan, Kevin Hughes, Siddharth Satuluru, Thomas Kim, Imon Banerjee, et al. Optimizing risk-based breast cancer screening policies with reinforcement learning. Nature medicine, 28(1):136–143, 2022.

[8] Lingjian Yang, Songsong Liu, Sophia Tsoka, and Lazaros G Papageorgiou. Mathematical programming for piecewise linear regression analysis. Expert systems with applications, 44:156–167, 2016.

Downloads

Published

2025-04-29

How to Cite

MESTER, A., & ANDREICA, A. (2025). NETWORK OPTIMIZATION PROBLEM APPLICABLE FOR BREAST CANCER SCREENING COST MINIMIZATION. Studia Universitatis Babeș-Bolyai Informatica, 70(1-2), 5–24. https://doi.org/10.24193/subbi.2025.01

Similar Articles

<< < 1 2 3 > >> 

You may also start an advanced similarity search for this article.