Carmine Sorgente
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Carmine Sorgente has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Raffaele Cerulli
Department of Mathematics University of Salerno Fisciano Salerno Italy
8 shared publications - Domenico Serra
Department of Mathematics University of Salerno Fisciano Salerno Italy
7 shared publications - Martina Cerulli
Department of Computer Science University of Salerno Fisciano Italy
6 shared publications - Claudia Archetti
University of Brescia
3 shared publications - Francesco Carrabs
Department of Mathematics University of Salerno Fisciano Italy
3 shared publications - Ivana Ljubić
ESSEC Business School Cergy‐Pontoise France
2 shared publications
Latest Publications
The Maximum τ‐Persistent Bipartition Problem: An Optimization Approach for Intrusion Detection in Heterogeneous In‐Vehicle Networks
The vulnerability of in‐vehicle communication networks to cyber threats has turned intrusion detection into a core research priority. Analyzing temporal communication patterns offers a powerful solution, given that normal vehicle operations rely on highly predictable, quasi‐periodic message exchanges. Consequently, any deviation from these regularities provides a reliable indicator of anomalous or malicious activity. Building on this observation, we propose a new approach that combines temporal analysis with a structural representation of network interactions. Specifically, we model interactions between electronic control units (ECUs) as a temporal graph , where nodes represent ECUs and time‐dependent edges capture communication patterns inferred from observed traffic. This representation enables the joint analysis of temporal and structural properties of the system. We observe that Denial of Service or flooding attack scenarios induce structured interaction patterns that can be naturally interpreted as bipartite graphs, where a set of compromised nodes systematically communicates with a distinct set of target nodes. Such persistent and asymmetric communication behaviors deviate from normal operation and provide a structural signature of malicious activity. Motivated by this insight, we introduce the maximum ‐persistent bipartition problem , an optimization problem that identifies a maximum‐cardinality bipartite subgraph that persists for at least timestamps in the temporal graph. We model it using integer programming and solve it through the state‐of‐the‐art solver Gurobi. Experiments on real in‐vehicle instances show that the method effectively detects attacks that directly affect communication timing, while experiments on synthetic temporal graphs compare the proposed approach with a degree‐based baseline and assess its computational scalability.
The Maximum τ‐Persistent Bipartition Problem: An Optimization Approach for Intrusion Detection in Heterogeneous In‐Vehicle Networks
The vulnerability of in‐vehicle communication networks to cyber threats has turned intrusion detection into a core research priority. Analyzing temporal communication patterns offers a powerful solution, given that normal vehicle operations rely on highly predictable, quasi‐periodic message exchanges. Consequently, any deviation from these regularities provides a reliable indicator of anomalous or malicious activity. Building on this observation, we propose a new approach that combines temporal analysis with a structural representation of network interactions. Specifically, we model interactions between electronic control units (ECUs) as a temporal graph , where nodes represent ECUs and time‐dependent edges capture communication patterns inferred from observed traffic. This representation enables the joint analysis of temporal and structural properties of the system. We observe that Denial of Service or flooding attack scenarios induce structured interaction patterns that can be naturally interpreted as bipartite graphs, where a set of compromised nodes systematically communicates with a distinct set of target nodes. Such persistent and asymmetric communication behaviors deviate from normal operation and provide a structural signature of malicious activity. Motivated by this insight, we introduce the maximum ‐persistent bipartition problem , an optimization problem that identifies a maximum‐cardinality bipartite subgraph that persists for at least timestamps in the temporal graph. We model it using integer programming and solve it through the state‐of‐the‐art solver Gurobi. Experiments on real in‐vehicle instances show that the method effectively detects attacks that directly affect communication timing, while experiments on synthetic temporal graphs compare the proposed approach with a degree‐based baseline and assess its computational scalability.
- 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
On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)
This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of researcher, paper pairs, as established by the Ministry, while respecting bounds on the minimum and maximum number of papers selectable for each researcher, as well as the maximum number of times a paper can be selected. Each pair is associated with a score, which depends on several bibliometric parameters related to both the paper and the author, and the goal of the problem is to select the pairs so as to maximize the total score. In this paper, we consider two versions of the problem, modeling the departments' and the university's perspectives, and for each of them, we provide an integer linear programming formulation. Moreover, we present two proofs showing that the problem can be solved optimally in polynomial time. The first proof consists of a polynomial‐time reduction to the capacitated minimum cost flow problem and is introduced to allow the problem to be solved without the need for commercial solvers (and the associated license costs); this is the ideal approach for any commercial software that already faces this problem. The second proof shows that the constraint matrices of the two formulations are totally unimodular. This property, together with the integrality of the right‐hand sides, ensures that the linear relaxations yield integer optimal solutions, which can be easily computed using the simplex method.
Open AccessOn the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)
This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of researcher, paper pairs, as established by the Ministry, while respecting bounds on the minimum and maximum number of papers selectable for each researcher, as well as the maximum number of times a paper can be selected. Each pair is associated with a score, which depends on several bibliometric parameters related to both the paper and the author, and the goal of the problem is to select the pairs so as to maximize the total score. In this paper, we consider two versions of the problem, modeling the departments' and the university's perspectives, and for each of them, we provide an integer linear programming formulation. Moreover, we present two proofs showing that the problem can be solved optimally in polynomial time. The first proof consists of a polynomial‐time reduction to the capacitated minimum cost flow problem and is introduced to allow the problem to be solved without the need for commercial solvers (and the associated license costs); this is the ideal approach for any commercial software that already faces this problem. The second proof shows that the constraint matrices of the two formulations are totally unimodular. This property, together with the integrality of the right‐hand sides, ensures that the linear relaxations yield integer optimal solutions, which can be easily computed using the simplex method.
- 1 May 2026
- Published by Springer Nature
- p. 321-333
Keyword Bidding Optimization in Paid Search Advertising: a Survey
- 1 May 2026
- Published by Springer Nature
- p. 321-333
Keyword Bidding Optimization in Paid Search Advertising: a Survey
- 1 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (3) , 693-709
Branch-and-Cut Algorithms for Colorful Components Problems
We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems differ in the objective function, which determines which partition is the best one. These problems have applications in community detection, cybersecurity, and bioinformatics. We present integer nonlinear formulations, which are then linearized using standard techniques. To solve these formulations, we develop exact branch-and-cut algorithms, embedding various improving techniques, such as valid inequalities, bounds limiting the number of variables, and warm-start and preprocessing techniques. Extensive computational tests on benchmark instances demonstrate the effectiveness of the proposed procedures. The branch-and-cut algorithms can solve reasonably sized instances efficiently. To the best of our knowledge, we are the first to propose an exact algorithm for solving these problems. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms & Applications. Funding: The work of M. Cerulli was partially funded by project “SEcurity and RIghts in the CyberSpace” [Grant PE00000014] under the MUR National Recovery and Resilience Plan funded by the European Union - NextGenerationEU. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0927 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0927 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (3) , 693-709
Branch-and-Cut Algorithms for Colorful Components Problems
We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems differ in the objective function, which determines which partition is the best one. These problems have applications in community detection, cybersecurity, and bioinformatics. We present integer nonlinear formulations, which are then linearized using standard techniques. To solve these formulations, we develop exact branch-and-cut algorithms, embedding various improving techniques, such as valid inequalities, bounds limiting the number of variables, and warm-start and preprocessing techniques. Extensive computational tests on benchmark instances demonstrate the effectiveness of the proposed procedures. The branch-and-cut algorithms can solve reasonably sized instances efficiently. To the best of our knowledge, we are the first to propose an exact algorithm for solving these problems. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms & Applications. Funding: The work of M. Cerulli was partially funded by project “SEcurity and RIghts in the CyberSpace” [Grant PE00000014] under the MUR National Recovery and Resilience Plan funded by the European Union - NextGenerationEU. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0927 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0927 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 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
- 14 May 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Branch-and-Cut Algorithms for Colorful Components Problems
We tackle three optimization problems in which a colored graph must be partitioned into connected colorful components. A component is colorful if all its vertices have different colors. We consider three different objectives, formulate the resulting problems as integer nonlinear programs and linearize them through standard linearization techniques. Then, we develop exact branch-and-cut algorithms, including families of valid inequalities for each problem, bounds reducing the size of the models, warm-start and preprocessing techniques.
- 14 May 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Branch-and-Cut Algorithms for Colorful Components Problems
We tackle three optimization problems in which a colored graph must be partitioned into connected colorful components. A component is colorful if all its vertices have different colors. We consider three different objectives, formulate the resulting problems as integer nonlinear programs and linearize them through standard linearization techniques. Then, we develop exact branch-and-cut algorithms, including families of valid inequalities for each problem, bounds reducing the size of the models, warm-start and preprocessing techniques.
- 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.