Carmine Sorgente

Dr. Carmine Sorgente


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 February 2025 in European Journal of Operational Research
Verified
Journal Article
Open access
FCF. Carrabs
F. Carrabs
RCR. Cerulli
R. Cerulli
Renata MansiniRenata Mansini
Renata Mansini
DSD. Serra
D. Serra
CSCarmine Sorgente
Carmine Sorgente

20 January 2023 in Computers & Operations Research
Verified
Journal Article
Open access
RCRaffaele Cerulli
Raffaele Cerulli
Francesca GuerrieroFrancesca Guerriero
Francesca Guerriero
ESEdoardo Scalzo
Edoardo Scalzo
CSCarmine Sorgente
Carmine Sorgente

28 April 2023 in European Journal of Operational Research
Verified
Journal Article
Open access
MCMartina Cerulli
Martina Cerulli
DSDomenico Serra
Domenico Serra
CSCarmine Sorgente
Carmine Sorgente
CAClaudia Archetti
Claudia Archetti
ILIvana Ljubić
Ivana Ljubić

1 May 2026 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
CAClaudia Archetti
Claudia Archetti
MCMartina Cerulli
Martina Cerulli
CSCarmine Sorgente
Carmine Sorgente
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/ .

10 January 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
RCRaffaele Cerulli
Raffaele Cerulli
CDCiriaco D'Ambrosio
Ciriaco D'Ambrosio
DSDomenico Serra
Domenico Serra
CSCarmine Sorgente
Carmine Sorgente
In order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs. The earliest setting addressed in the literature aims to minimize the number of different media types, i.e., distinct labels, used in the network. Despite being extensively addressed, such a setting completely ignores edge costs. This led to the definition of more realistic versions, where budgets for the total cost, or the number of distinct labels allowed, were introduced. In this paper, we introduce and prove the NP-hardness of the Budgeted Labeled Minimum Spanning Tree problem, consisting in minimizing the cost of a spanning tree while satisfying specified budget constraints for each label type. This problem combines the challenges of cost efficiency and label diversity within a fixed budgetary framework, providing a more realistic and practical approach to network design. We provide three distinct mathematical programming formulations of the problem and design a Lagrangian approach to derive tighter lower bounds for the optimal solution of the problem. The performances of the proposed methods are assessed by conducting a series of computational experiments on a variety of randomly generated instances, which showed how the complexity of the problem increases as the size of the network, as well as the number of labels, increase and the budget restrictions are tightened.

14 May 2025 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
CAClaudia Archetti
Claudia Archetti
MCMartina Cerulli
Martina Cerulli
CSCarmine Sorgente
Carmine Sorgente
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.