Raffaele Cerulli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Raffaele Cerulli has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
- Francesco Carrabs
Department of Mathematics University of Salerno Fisciano Italy
26 shared publications - Andrea Raiconi
Istituto per le Applicazioni del Calcolo “Mauro Picone” (Naples Unit), National Research Council, Via Pietro Castellino 111, 80131 Naples, Italy
12 shared publications - Carmine Sorgente
Department of Mathematics University of Salerno Fisciano Italy
8 shared publications - Ciriaco D'Ambrosio
University of Salerno
7 shared publications - Domenico Serra
Department of Mathematics University of Salerno Fisciano Salerno Italy
7 shared publications - Carmine Cerrone
Department of Economics and Business Studies, University of Genova, 16126 Genova, Italy
6 shared publications
Latest Publications
- Open Access
- 3 October 2026
- Published by Elsevier in Kuwait Journal of Science
- Vol. 54 (1)
The set covering problem with over-coverage penalties
- 3 October 2026
- Published by Elsevier in Kuwait Journal of Science
- Vol. 54 (1)
Open AccessThe set covering problem with over-coverage penalties
- Open Access
- 5 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (1) , 31-49
Obtaining k-degree anonymous networks via mathematical programming
- 5 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (1) , 31-49
Open AccessObtaining k-degree anonymous networks via mathematical programming
- 4 February 2026
- Published by Springer Nature in Operations Research Forum
- Vol. 7 (1) , 22
Kidney Exchanges with Desensitization and Orphans: A Matheuristic Approach
- 4 February 2026
- Published by Springer Nature in Operations Research Forum
- Vol. 7 (1) , 22
Kidney Exchanges with Desensitization and Orphans: A Matheuristic Approach
- Open Access
Minimum cost network flow with interval capacities: The worst-case scenario
We study the problem of determining the worst optimal value and characterizing the corresponding worst-case scenarios in minimum cost network flow problems with interval uncertainty in arc capacities. In this setting, each capacity can take any value within its specified lower and upper bounds. We prove that computing the worst optimal value is a strongly NP-hard problem and remains NP-hard even when restricted to series-parallel graphs. Further, we propose a mixed-integer linear programming formulation that computes the exact worst optimal value, as well as a pseudopolynomial-time algorithm designed for the special case of series-parallel graphs. We also examine the structural properties of the most extremal worst-case scenarios and show that the arcs whose capacities are not fixed at their interval bounds form a forest. This result establishes an upper bound on the number of such arcs, which we show to be tight by constructing a class of instances in which the bound is attained. Finally, we investigate the more-for-less paradox in minimum cost network flow problems with interval capacities, which occurs in instances where increasing the required flow leads to a decrease in the worst-case optimal cost. We provide a general characterization of this phenomenon using augmenting paths and establish a stronger characterization for complete graphs. In addition, we discuss the properties of the cost matrices immune against the paradox and prove that deciding whether a given cost matrix has this property is a strongly co-NP-hard problem.
Open AccessMinimum cost network flow with interval capacities: The worst-case scenario
We study the problem of determining the worst optimal value and characterizing the corresponding worst-case scenarios in minimum cost network flow problems with interval uncertainty in arc capacities. In this setting, each capacity can take any value within its specified lower and upper bounds. We prove that computing the worst optimal value is a strongly NP-hard problem and remains NP-hard even when restricted to series-parallel graphs. Further, we propose a mixed-integer linear programming formulation that computes the exact worst optimal value, as well as a pseudopolynomial-time algorithm designed for the special case of series-parallel graphs. We also examine the structural properties of the most extremal worst-case scenarios and show that the arcs whose capacities are not fixed at their interval bounds form a forest. This result establishes an upper bound on the number of such arcs, which we show to be tight by constructing a class of instances in which the bound is attained. Finally, we investigate the more-for-less paradox in minimum cost network flow problems with interval capacities, which occurs in instances where increasing the required flow leads to a decrease in the worst-case optimal cost. We provide a general characterization of this phenomenon using augmenting paths and establish a stronger characterization for complete graphs. In addition, we discuss the properties of the cost matrices immune against the paradox and prove that deciding whether a given cost matrix has this property is a strongly co-NP-hard problem.
- Open Access
- 13 February 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (2) , 414-435
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints
- 13 February 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (2) , 414-435
Open AccessHybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints
- Open Access
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs
A cluster graph is a disjoint union of cliques, obtained by clustering the nodes of a given network and then removing the edges between nodes assigned to different clusters. The Cluster Deletion problem asks for the smallest subset of edges to be removed from a network in order to produce a cluster graph, which is equivalent to determining the largest subset of edges to be preserved. The problem finds application in many fields, including computational biology, bioinformatics, and wireless sensor networks, and it is known to be ‐hard on general graphs. In this work, we formulate the problem as an integer linear program, and we devise a heuristic approach based on edge contraction operations. We test the proposed approaches on both artificial instances and benchmark biological networks.
Open AccessExact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs
A cluster graph is a disjoint union of cliques, obtained by clustering the nodes of a given network and then removing the edges between nodes assigned to different clusters. The Cluster Deletion problem asks for the smallest subset of edges to be removed from a network in order to produce a cluster graph, which is equivalent to determining the largest subset of edges to be preserved. The problem finds application in many fields, including computational biology, bioinformatics, and wireless sensor networks, and it is known to be ‐hard on general graphs. In this work, we formulate the problem as an integer linear program, and we devise a heuristic approach based on edge contraction operations. We test the proposed approaches on both artificial instances and benchmark biological networks.
- 31 January 2025
- Published by Springer Nature
- p. 161-171
A Service Oriented Architecture for Clinical Decision Support Systems Based on Artificial Intelligence
- 31 January 2025
- Published by Springer Nature
- p. 161-171
A Service Oriented Architecture for Clinical Decision Support Systems Based on Artificial Intelligence
- Open Access
- 21 September 2024
- Published by Springer Nature in Neural Computing and Applications
- Vol. 36 (35) , 22461-22484
Improving patient’s medical history classification using a feature construction approach based on situation awareness and granular computing
Healthcare decision support systems aid physicians in disease classification by analyzing patients’ medical histories to suggest preliminary diagnoses. As physicians largely base their analysis on anamnesis, integrating this process into an automated recommendation system can expedite decision-making and transition to relevant clinical investigations, thus enhancing efficiency in diagnosing potential pathologies. In this research, an innovative method for feature construction is introduced, drawing on the concepts of Situation Awareness and Granular Computing. The aim of this method is to enhance the performance of out-of-the-box classification algorithms used in machine learning. The approach is specifically tailored to mimic physicians’ cognitive processes when analyzing a patient’s medical history, resulting in the generation of new, information-dense features that can be used for classification tasks. By employing this strategy, a deeper comprehension of the data can be achieved, as well as a more precise categorization of anamneses in relation to possible medical conditions. To authenticate the efficacy of the proposed technique, three major disease categories, namely cardiac, gastrointestinal, and thyroid, were considered. The dataset comprised 1213 medical histories. The experimental results indicate that the study’s six classifiers attained a balanced accuracy exceeding 90%. Among these, the SVM classifier demonstrated the highest balanced accuracy at 93%. Overall, the proposed approach resulted in an average increase of 16 percentage points in balanced accuracy, representing an improvement over the traditional methods commonly employed in machine learning. This approach could be integrated into a clinical decision support system, aiding physicians in accurately identifying necessary investigations and expediting diagnosis.
- 21 September 2024
- Published by Springer Nature in Neural Computing and Applications
- Vol. 36 (35) , 22461-22484
Open AccessImproving patient’s medical history classification using a feature construction approach based on situation awareness and granular computing
Healthcare decision support systems aid physicians in disease classification by analyzing patients’ medical histories to suggest preliminary diagnoses. As physicians largely base their analysis on anamnesis, integrating this process into an automated recommendation system can expedite decision-making and transition to relevant clinical investigations, thus enhancing efficiency in diagnosing potential pathologies. In this research, an innovative method for feature construction is introduced, drawing on the concepts of Situation Awareness and Granular Computing. The aim of this method is to enhance the performance of out-of-the-box classification algorithms used in machine learning. The approach is specifically tailored to mimic physicians’ cognitive processes when analyzing a patient’s medical history, resulting in the generation of new, information-dense features that can be used for classification tasks. By employing this strategy, a deeper comprehension of the data can be achieved, as well as a more precise categorization of anamneses in relation to possible medical conditions. To authenticate the efficacy of the proposed technique, three major disease categories, namely cardiac, gastrointestinal, and thyroid, were considered. The dataset comprised 1213 medical histories. The experimental results indicate that the study’s six classifiers attained a balanced accuracy exceeding 90%. Among these, the SVM classifier demonstrated the highest balanced accuracy at 93%. Overall, the proposed approach resulted in an average increase of 16 percentage points in balanced accuracy, representing an improvement over the traditional methods commonly employed in machine learning. This approach could be integrated into a clinical decision support system, aiding physicians in accurately identifying necessary investigations and expediting diagnosis.
- Open Access
- 31 July 2024
- Published by Springer Nature in Soft Computing
- Vol. 28 (20) , 12021-12041
A biased random-key genetic algorithm for the knapsack problem with forfeit sets
This work addresses the Knapsack Problem with Forfeit Sets, a recently introduced variant of the 0/1 Knapsack Problem considering subsets of items associated with contrasting choices. Some penalty costs need to be paid whenever the number of items in the solution belonging to a forfeit set exceeds a predefined allowance threshold. We propose an effective metaheuristic to solve the problem, based on the Biased Random-Key Genetic Algorithm paradigm. An appropriately designed decoder function assigns a feasible solution to each chromosome, and improves it using some additional heuristic procedures. We show experimentally that the algorithm outperforms significantly a previously introduced metaheuristic for the problem.
- 31 July 2024
- Published by Springer Nature in Soft Computing
- Vol. 28 (20) , 12021-12041
Open AccessA biased random-key genetic algorithm for the knapsack problem with forfeit sets
This work addresses the Knapsack Problem with Forfeit Sets, a recently introduced variant of the 0/1 Knapsack Problem considering subsets of items associated with contrasting choices. Some penalty costs need to be paid whenever the number of items in the solution belonging to a forfeit set exceeds a predefined allowance threshold. We propose an effective metaheuristic to solve the problem, based on the Biased Random-Key Genetic Algorithm paradigm. An appropriately designed decoder function assigns a feasible solution to each chromosome, and improves it using some additional heuristic procedures. We show experimentally that the algorithm outperforms significantly a previously introduced metaheuristic for the problem.