Francesco CarrabsCurriculum Vitæ17/12/2020

Department of MathematicsUniversity of Salerno

Via Giovanni Paolo II 13284084, Fisciano (SA), Italy

T +39 089963326B fcarrabs@unisa.it

Í docenti.unisa.it/020511/homeOrcid ID: 0000-0003-2187-8624

Personal Information

Name: Francesco Carrabs

Born: Atripalda (AV), 16 December 1976

Nationality: Italian

Languages: Italian, English

CurrentPosition:

Associate Professor in Operations Research at the Department of Mathematics,University of Salerno.

Professional Experience

December 2008 -September 2020

Researcher in Operations Research at the Department of Mathematics and ComputerScience, University of Salerno.

January 2007 -December 2008

Postdoctoral fellow at the Department of Mathematics and Computer Science,University of Salerno. Research and teaching related to Operations Research.

March 2006 -July 2006

Cooperation agreement with the Department of Statistics, Probability, and AppliedStatistics of University of Rome “Sapienza”. Supervisor: prof. Paolo Dell’Olmo.

October 2006 -March 2007

Postdoctoral internship at the HEC Montréal (Canada Research Chair in Logisticsand Transportation). Supervisor: prof. Jean-François Cordeau.

October 2005 -December 2005

Visiting scholar at the CRT (Centre de recherche sur les transports), Universityof Montréal, Canada. Supervisors: prof. Gilbert Laporte and prof. Jean-FrançoisCordeau.

October 2004 -May 2005

Visiting scholar at the CRT, University of Montréal, Canada. Supervisors: prof.Gilbert Laporte and prof. Jean-François Cordeau.

Education

26 February2006

Ph.D. in Computer Science at the DIA, University of Salerno. Thesis: Heuristics andexact approaches for transportation problems with pickup and delivery, supervisor:prof. Raffaele Cerulli.

25 July 2002 Master degree (cum laude) in Computer Science, University of Salerno. Thesis:Shortest Path Tree problem: new data structures and caliber heuristic, supervisor:prof. Raffaele Cerulli.

Conferences and Seminaries

Conferences and Seminaries Talks Given

{ 9th International Conference on Computational Logistics (ICCL 2018),Vietri sul Mare, Italia.- About the all-colors shortest path problem.

{ 29th European Conference on Operational Research (EURO 2018), Va-lencia, Spain.- A metaheuristic algorithm for the all-colors shortest path problem.

{ International Conference on Applied Combinatorial Optimization(EURO/ALIO 2018), Bologna, Italy.- A heuristic approach for the all-colors shortest path problem.

{ 4th Soft Computing Days: a bilateral China-Italy Workshop (2018),Benevento-Fisciano, Italia.- Relationship between the All-colors Shortest Path and the Generalized TravelingSalesman problems.

{ 14 May 2018 Seminar at Istituto Di Analisi Dei Sistemi Ed Informatica “AntonioRuberti”, Consiglio Nazionale delle Ricerche, Rome, Italy.- The all-colors shortest path problem: properties and algorithms.

{ International Conference on Optimization and Decision Science (ODS2017), Sorrento, Italy.- A Tabu Search Heuristic for the Set Orienteering Problem.

{ 21th Conference of the International Federation of Operational Re-search Societies (IFORS 2017), Quebec City, Canada.- A Matheuristic for the Set Orienteering Problem.

{ 2nd Soft Computing Days: a bilateral China-Italy Workshop (2016),Pechino, Cina.- A Branch and Cut Approach for the Orderly Colored Longest Path Problem.

{ 46th Annual Conference of the Italian Operations Research Society(AIRO 2016), Trieste, Italy.- A Compact Formulation for the Orderly Colored Longest Path Problem.

{ 8th IFAC Conference on Manufacturing Modelling, Management &Control (MIM 2016), Troyes, France.- Extending Lifetime Through Partial Coverage And Roles Allocation inConnectivity-Constrained Sensor Networks.

{ 4th International Symposium on Combinatorial Optimization (ISCO2016), Vietri sul Mare, Italy.- Exact and heuristic approaches for the maximum lifetime problem in sensornetworks with coverage and connectivity constraints.

{ 3rd Workshop Unical 2015, Cosenza, Italy.- A new Discretization Schema for the Close-Enough Traveling Salesman Problem.

{ 45th Annual Conference of the Italian Operations Research Society(AIRO 2015), Pisa, Italy.- Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem.

{ 8th Winter Conference of the Italian Operations Research Society (AI-RO Winter 2015), Champoluc, Italy.- A Column Generation Approach for the Maximum Lifetime Wireless SensorNetwork Problems (MLP and α-MLP).

{ 2nd Workshop Unical 2014, Cosenza, Italy.A hybrid exact approach for maximizing lifetime in wireless sensor networks.

{ 1st Workshop Unical 2013, Cosenza, Italy.Monochromatic Tree Partitioning Problem.

{ 42th Annual Conference of the Italian Operations Research Society(AIRO 2011), Brescia, Italy.- A genetic algorithm for the weighted feedback vertex set problem.- A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback VertexSet Problem.

{ 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimi-zation (CTW2011), Frosinone, Italy.- The maximum labeled clique problem.

{ 41th Annual Conference of the Italian Operations Research Society(AIRO 2010), Villa San Giovanni, Italy- The Monochromatic Set Partitioning problem.

{ 40th Annual Conference of the Italian Operations Research Society(AIRO 2009), Siena, Italy.- A Branch and Bound algorithm to solve the Double Traveling Salesman problemwith Multiple Stacks.

{ 38th Annual Conference of the Italian Operations Research Society(AIRO 2007), Genova, Italy.- A Branch and Bound approach for the Minimum Colors Maximum MatchingProblem.

{ 21th European Conference on Operational Research (EURO 2006), Rey-kjavik, Iceland.- A Cluster-Lightening Route Reduction Strategy for the Vehicle Routing Problemwith Time Windows.

{ 37th Annual Conference of the Italian Operations Research Society(AIRO 2006), Cesena, Italy.- A Branch and Bound approach for the Pickup and Delivery Traveling SalesmanProblem with LIFO Loading.- Reoptimization and Critical Request Individuation for the VRPTW.

{ 20 October 2005 Seminar at Centre de Recherche sur les Transports, Universitádi Montréal, Canada.- Variable Neighborhood Search for the pickup and delivery TSP with LIFO loadingconstraint.

{ 36th Annual Conference of the Italian Operations Research Society(AIRO 2005), Camerino, Italy.-Metaheuristics for the pickup and delivery TSP with LIFO loading constraint.

{ Optimization Days 2005, Montréal, Canada.-Metaheuristics for the pickup and delivery TSP with LIFO loading constraint.

{ 35th Annual Conference of the Italian Operations Research Society(AIRO 2004), Lecce, Italy.-Efficient Visiting Strategy and Data Structure for SPT Algorithms.

{ 3rd Cologne-Twente Workshop on Graphs and Combinatorial Optimi-zation (CTW 2004), Loveno di Menaggio, Italy.- Minimum Weighted Feedback Vertex Set on Diamonds.

Conference Session Chair

{ Session title: Vehicle Routing III, 9th International Conference on ComputationalLogistics (ICCL 2018), Vietri sul Mare, Italy.

{ Session title: Combinatorial Optimization on Graphs I, 29th European Conferenceon Operational Research (EURO 2018), Valencia, Spagna.

{ Session title: HEUR1 - Heuristic and metaheuristic 1, International Conferenceon Optimization and Decision Science, (ODS 2017), Sorrento, Italia.

{ Session title: Heuristics for routing, 21th Conference of the InternationalFederation of Operational Research Societies (IFORS 2017), Québec City, Canada.

{ Session Chair at conference 1st Soft Computing Days: a bilateral China-ItalyWorkshop (2016), Fisciano, Italia.

Conferences Attended

{ Optimization Tales (2020), Rende, Italy.

{ 3rd International Conference on Optimization and Decision Science.(ODS 2019), Genova, Italia.

{ 7th Workshop of the EURO Working Group on Vehicle Routing andLogistics optimization (VeRoLog 2019), Seville, Spain.

{ 2nd International Conference on Optimization and Decision Science.(ODS 2018), Taormina, Italia.

{ Odysseus: 7th International Workshop on Freight Transportation andLogistics (2018), Cagliari, Italy.

{ Heuristics and Metaheuristics: Foundation, Methodology andApplications (2017), Isernia, Italy

{ 4th International School on Mathematics “Guido Stampacchia”: GraphTheory, Algorithms and Applications (2017), Erice, Italy.

{ 1st Workshop Soft Computing Days (2016), Salerno, Italy.

{ 44th Annual Conference of the Italian Operations Research Society(AIRO 2014), Como, Italy.

{ 3rd International School on Mathematics “Guido Stampacchia”:Graph Theory, Algorithms and Applications (2014), Erice, Italy.

{ International Colloquium on Graphs and Optimization (GO IX 2014),Sirmione, Italy.

{ European Conference on Operational Research (EURO 2013), Rome,Italy.

{ 43rd Annual Conference of the Italian Operations Research Society(AIRO 2012), Vietri sul Mare, Italy.

{ 2nd International School on Mathematics “Guido Stampacchia”:Graph Theory, Algorithms and Applications (2011), Erice, Italy.

{ (School) Optimization, Machine Learning and Bioinformatics 2010,Erice, Italy.

{ 13th Combinatorial Optimization Workshop 2009, Aussois, France.

{ 1st International School on Mathematics “Guido Stampacchia”: GraphTheory, Algorithms and Applications (2008), Erice, Italy.

Membership of Organizing Committees

{ 5th International School on Mathematics “Guido Stampacchia” Erice: GraphTheory, Algorithms and Applications (2020).

{ 9th International Conference on Computational Logistics (ICCL 2018)(Vice-President).

{ 4th Soft Computing Days: a bilateral China-Italy Workshop (2018).

{ International Conference of Optimization and Decision Science (ODS 2017).

{ Heuristics and Metaheuristics: Foundation, Methodology and Applications (2017).

{ 4th International School on Mathematics “Guido Stampacchia” Erice: GraphTheory, Algorithms and Applications (2017).

{ 1st Soft Computing Days: a bilateral China-Italy Workshop (2016).

{ 4th International Symposium on Combinatorial Optimization (ISCO 2016)(Vice-President).

{ 43th Annual Conference of the Italian Operational Research Society (AIRO 2012).

Membership of Scientific Committees

{ 11th International Conference on Computational Logistics (ICCL 2020).

{ 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization(CTW2020).

{ 6th International Symposium on Combinatorial Optimization (ISCO 2020).

{ 1st Artificial Intelligence & Industrial Applications (A2IA’2020).

{ 3rd International Conference and Summer School ’Numerical Computations:Theory and Algorithms (NUMTA2019).

{ 9th International Conference on Computational Logistics (ICCL 2018).

{ 5th International Symposium on Combinatorial Optimization (ISCO 2018).

{ 6th International Conference on Operations Research and Enterprise Systems(ICORES 2017).

{ 10th International Workshop on Hybrid Metaheuristics (HM 2016).

{ 4th International Symposium on Combinatorial Optimization (ISCO 2016).

Funded Research Project

Responsible

2019-2022 Responsible of the work package WP2: Stato dell’arte delle tecnologie di raccoltae analisi dei Big Data e delle tecniche di analisi predittiva of project “PRIAMOS- Piattaforma Integrata, software e tecnologica, per l’acquisizione e l’analisi didati eterogenei relativi ad aspetti di sicurezza e manutenzione, configurabile perdiverse applicazioni in ambito industria e trasporti”. PON “Imprese e competitività”2014-2020 FESR funded by Italian Ministry of Economic Development.

2018-2021 Responsible of task 7.3: Validazione rispetto agli obiettivi di progetto, cost deploy-ment. PON “Ricerca e Innovazione”. Project Title: “PICO e PRO - Processi Integra-ti e COnnessi per l’Evoluzione Industriale nella PROduzione”. Code ARS01_01061,funded by the European Commission.

Participant

He has taken part in the following national and international research projects:

2015-2018 PRIN. SPORT - Smart PORt Terminals).

2014 PON01_02705, FIBAC (Fruizione Innovativa dei Beni Artistici e Culturali)Progettazione Servizi ed applicazioni per il prototipo Museo Reale.

2007-2013 POR Campania FESR, WISCH (Work Into Shaping Campania’s Home) Stra-tegie di ottimizzazione topologica per la realizzazione di componenti in additivemanifacturing.

2011 Programma Vigoni (Exchange program for researchers between the Italian andGerman university institutions), Sostenibilitá e pianificazione della supply chainecologica. Modelli di flusso su grafi e metodi di soluzione.

2009 POR Campania, EBuild. POR Misura 3.17 - Ricerca industriale e sviluppocompetitivo - Metadistretto ICT.

2007-2009 PRIN, Modelli per il monitoraggio e l’instradamento efficiente del flusso di merci sureti di trasporto multimodale. (2007J494P3_004). Scientific coordinator of project:Prof. P. Dell’Olmo (Sapienza University of Rome).

MIUR ex 60% Projects:

2019 ORSA195583, Sottografi K-edge Connessi.

2018 ORSA187018, Varianti del problema del commesso viaggiatore.

2017 ORSA179458, Ottimizzazione robusta.

2016 ORSA167701, Spanning tree generalizzati ed altre varianti.

2016 ORSA167778, Modelli matematici: teoria e applicazioni.

2015 ORSA150459, Euristiche costruttive e sensors networks.

2014 ORSA142082, Reti di sensori eterogenee e sottostrutture eterogenee di un grafo.

2013 ORSA131490, Problemi di wireless sensor networks.

2012 ORSA128040, Ottimizzazione su reti di traffico e social network.

2011 ORSA114421, Reti di flusso con capacità variabile nel tempo e problemi di wirelesssensor networks.

2010 ORSA109444, Problemi di localizzazione e nuovi approcci metaeuristici.

2009 ORSA098140, Problemi di copertura su grafi.

2009 ORSA091577, Modelli Matematici e Informatici per il Trattamento dell’Informazio-ne e Studio di problemi fisico-matematici.

Institutional Activities

Since 2020 Member of Presidio della Qualità di Ateneo of the University of Salerno.

Since 2020 Delegate of the Department of Mathematics for the Distance Teaching of theUniversity of Salerno.

Since 2018 Member of the Monitoraggio Carriere e Analisi Opinioni degli Studenti committeeof the Department of Mathematics of the University of Salerno.

Since 2018 Member of Placement committee of the Department of Mathematics of the Universityof Salerno.

Since 2016 Delegate of the Department of Mathematics for the Data WareHouse of theUniversity of Salerno.

2014 - 2016 Member of the Monitoraggio e Analisi committee of the Department of Mathematicsof the University of Salerno.

Since 2013 Member of the Riesame AVA-ANVUR committee of the Department of Mathematicsof the University of Salerno.

2013 - 2020 Member of the Board of the Department of Mathematics of the University ofSalerno.

Member of the following evaluation committees:

October 2020 Member of the evaluation committee for a research fellow (Assegno di Ricerca).Project title: Approssimazione structure-preserving di problemi evolutivi.

October 2020 Member of the evaluation committee for a self-employed job assignment on theproject: PICO e PRO - Processi Integrati e COnnessi per l’Evoluzione Industrialenella PROduzione.

May 2020 Member of the evaluation committee for a research fellow (Assegno di Ricerca),SSD: MAT/09.

December 2019 Member of the evaluation committee for a research fellow (Assegno di Ricerca).Project title: Tecniche di ottimizzazione strutturale per l’adeguamento sismico diedifici in cemento armato.

September 2019 Member of the evaluation committee for a self-employed job assignment on theproject: PICO e PRO - Processi Integrati e COnnessi per l’Evoluzione Industrialenella PROduzione.

July 2018 Member of the evaluation committee for a research fellow (Assegno di Ricerca).Project title: Modelli matematici di tipo ILP (Interval Linear Programming.

May 2018 Member of the evaluation committee for a scholarship (Borse di Ricerca volte alsostegno di ricercatori per la promozione di processi di Open Innovation negli ambititecnologici prioritari della RIS 3). Project title: Definizione di intervalli di servizio(time windows) nella distribuzione merci per la riduzione della congestione urbanain un’ottica Smart City.

February 2018 Member of the evaluation committee for a research fellow (Assegno di Ricerca).Project title: Applicazioni della logica polivalente a problemi di ottimizzazione.

September 2015 Member of the evaluation committee for a research fellow (Assegno di Ricerca).Project title: Reti di sensori distribuite sul territorio: gestione e localizzazioneottimale.

June 2015 Member of the evaluation committee for a research contract. Project title: Ana-lisi di uno strumento software per l’immagazzinamento, la manipolazione e lavisualizzazione di dati geolocalizzati tramite l’ausilio di sensori.

Activities in Ph.D. Courses

A.A. 2020/2021 Member of the Ph.D School Board in Matematica, Fisica Ed Applicazionidell’Università di Salerno, Ciclo: XXXVI.

February 2020 Teacher of the Ph.D course: Exact and heuristic approaches for optimization pro-blems. Ph.D. in Mathematics, Physics and Applications (cycle XXXV), Departmentof Mathematics, University of Salerno.

December 2019 Ph.D External Evaluator, Ph.D School in Information and Communication Techno-logies (Cycle: XXXII), University of Calabria. Title thesis evaluated: Classificationproblems of medical image: instance space optimization models for multiple instancelearning.

A.A. 2013/2014 Member of the Ph.D School Board in Mathematics, Physic and Applications,University of Salerno, Cycle: XXIX.

A.A. 2012/2013 Member of the Ph.D School Board in Computer Science, University of Salerno,Cycle: XXVIII.

A.A. 2011/2012 Member of the Ph.D School Board in Computer Science, University of Salerno,Cycle: XXVII.

A.A. 2009/2010 Member of the Ph.D School Board in Biologia dei Sistemi, University of Salerno,Cycle: XXV.

Co-supervisor of the following Ph.D. students:

{ Ciriaco D’Ambrosio, Coverage in Wireless Sensor Networks: Models and Algori-thms (2013). Ph.D. in Computer Science (cycle XIII), Department of ComputerScience, University of Salerno.

{ Rosa Pentangelo, Conflicting edges spanning trees and NP-Hard subgraph identi-fication problems (2018). Ph.D. in Mathematics, Physics and Applications (cycleXXX), Department of Mathematics, University of Salerno.

{ Federica Laureana, Polyhedral Analysis and Branch and Cut Algorithms for SomeNP-hard Spanning Subgraph Problems (2019). Ph.D. in Mathematics, Physics andApplications (cycle XXXII), Department of Mathematics, University of Salerno.

{ Domenico Serra. Ph.D. in Mathematics, Physics and Applications (cycle XXXV),Department of Mathematics, University of Salerno.

Teaching

Teacher of the following courses at the University of Salerno (1 CFU = 8 hours):

A.A Course CFU Department TeachingEvaluation*

2020/2021Operations Research (T ) 6 Computer ScienceOperations Research (T ) 4 MathematicsOptimization (T ) 3 Mathematics

2019/2020Operations Research (T ) 6 Computer Science 3.61/4Operations Research 3 Mathematics 3.67/4Optimization (T ) 3 Mathematics 3.71/4

2018/2019Operations Research (T ) 6 Computer Science 3.60/4Operations Research 3 Mathematics 3.71/4Optimization 3+3 Mathematics 3.66/4

2017/2018Operations Research 3 Computer ScienceOperations Research 3 Mathematics 3.80/4Optimization 3 Mathematics 3.79/4

2016/2017Operations Research (T ) 6+3 Computer Science 3.34/4Operations Research 3 Mathematics 3.77/4Optimization 3 Mathematics 3.75/4

2015/2016Operations Research (T ) 6 Computer Science 3.40/4Operations Research 3 Mathematics 3.65/4Optimization 3 Mathematics 3.90/4

2014/2015Operations Research (T ) 6 Computer Science 3.45/4Operations Research 3 Mathematics 3.52/4Optimization 3 Mathematics 3.78/4

2013/2014Operations Research (T ) 6 Computer Science 3.45/4Operations Research 3 Mathematics 3.62/4Optimization 3 Mathematics 3.64/4

2012/2013Operations Research (T ) 6 Computer ScienceOperations Research 3 MathematicsOperations Research and Logistics (T ) 3 Computer Science

2011/2012Operations Research 6 Computer ScienceOperations Research 3 MathematicsOperations Research and Logistics (T ) 3 Computer Science

2010/2011 Operations Research 6 Computer Science

2009/2010Operations Research 4 Computer ScienceOperations Research 4 Computer ScienceOperations Research 2 (T ) 1.5 Computer Science

2008/2009 Operations Research Tutor 6 Computer Science(T) = course lecturer* Data from the integrated information system for University administration (U-GOV). The field isempty when data has not been provided.

He has been chief or member of the evaluation committees of all the above-mentionedcourses, as well as a member of several Bachelor’s and Master’s Degrees committeesin Mathematics and Computer Science.

Member of the following evaluation committees:

August 2020 Member of the evaluation committee for 1 teaching contracts (public selection,by titles) of Algoritmi di Ottimizzazione, SSD MAT/09 (60 hours), ManagementEngineering Course, University of Salerno.

April 2020 Member of the evaluation committee for 2 teaching contracts (public selection,by titles) of Ricerca Operativa e Basi di Dati - modulo Ricerca Operativa, SSDMAT/09, (30 hours), Management Engineering Course, University of Salerno.

February 2020 Member of the evaluation committee for 1 teaching contract, (public selection, bytitles) of Sistemi di supporto alle decisioni, SSD MAT/09, (24 hours), MathematicsCourse, University of Salerno.

April 2019 Member of the evaluation committee for 2 teaching contracts (public selection,by titles) of Ricerca Operativa e Basi di Dati - modulo Ricerca Operativa, SSDMAT/09, (30 hours), Management Engineering Course, University of Salerno.

Other Didactic Activities

Supervisor for several graduation thesis at the Departments of Mathematics and ofComputer Science of University of Salerno.

2014 Teacher for the project Ricerca Operativa (C-2-FSE-2013-231) funded by EuropeanSocial Fund. PON 2007-2013 “Competenze per lo sviluppo”.

As part of the “Piano Nazionale Lauree Scientifiche” project, he carried out teachingactivities for the following courses:

A.A. 2018/2019: Teacher of the Operations Research Laboratory;

A.A. 2017/2018: Teacher of the Operations Research Laboratory;

A.A. 2015/2016: Teacher of the Operations Research Laboratory;

A.A. 2014/2015: Teacher of the Operations Research;

A.A. 2012/2013: Teacher of the Operations Research;

A.A. 2011/2012: Teacher of the Operations Research;

Editorial activity

Editorial board member of the following international journal:

Since July 2018 Soft Computing (Associate Editor) (Handled papers: 170)

Guest Editor of special issues:

{Mathematical Foundations and Practical Applications of CombinatorialOptimization, Networks, 71(4), 2018.

{ Application-motivated Nonlinear Programming, Journal of Optimization Theoryand Applications, 164(3), 2015.

Since 2010 he reviewed 74 papers for the following international journals(certified by Publons):

1) 4OR 2) Applied Soft Computing 3) AIRO Springer series 4) Computers &Operations Research 5) Computational Optimization and Applications 6) EUROJournal on Transportation and Logistics 7) European Journal of Operational Re-search 8) IISE Transactions 9) International Journal of Distributed Sensor Networks10) International Journal of Electrical and Computer Engineering 11) InternationalJournal of Engineering Business Management 12) International Transactions inOperational Research 13) Journal of Ambient Intelligence and Humanized Compu-ting 14) Lecture Notes in Computer Science 15) Lecture Notes in Networks andSystems 16) Networks 17) Omega 18) Operational Research 19) OptimizationLetters 20) Procedia - Social and Behavioral Sciences 21) RAIRO - OperationsResearch 22) Sensors 23) Soft Computing 24) Springer Proceedings in Mathematicsand Statistics 25) Transportation Science

Affiliation, Awards and Grants

2018 Faculty affiliate of the Geoinformatics and Earth Observation Laboratory in theDepartment of Geography and Institute for CyberScience at the Pennsylvania StateUniversity, USA.

2017 FFABR national research grant(MIUR Funds for financing fundamental research activities);

2011-2014 Evaluation of Research Quality (VQR): Score 1.7/2

2012 “Incentivo una tantum” (competitive award among the researchers of the Universityof Salerno for didactic and research activities in the years 2009-2011);

2006 Postdoctoral internship at the HEC Montréal (Canada Research Chair in Logisticsand Transportation). Supervisor: Jean-François Cordeau.

Research

The research activity is mainly devoted to the theoretical study, the developmentand the implementation of exact and heuristic approaches for the resolution of thefollowing optimization problems:

{ Circle Packing: [37].

{ Feedback Vertex Set: [24], [30], [31], [40].

{ Interval Programming: [32], [43].

{ Labeled Graph Problems: [9], [13], [12], [27], [38], [39].

{ Offsetting Inventory Cycle Problem: [20].

{ Seismic Retrofitting Problems: [10].

{ Set Orienteering Problem: [11], [7].

{ (Variants of) Minimum Spanning Tree Problem: [6], [8], [14], [25], [2].

{ (Variants of) Shortest Path Problem: [15], [35], [3], [4].

{ (Variants of) Traveling Salesman Problems: [1], [16], [26], [28], [29], [33].

{ Vehicle Routing Problems: [19], [42].

{Wireless Sensor Network: [5], [17], [18], [21], [22], [23], [34], [36], [41].

Bibliometric data (sources: Scopus/ISI WoS)

Articles published on international journals 31Proceeding articles with peer-review 9Book Chapter 2Special Issues Preface 2Number of citations 394Self citations ~17%H-index 10

Publications

[1] F. Carrabs, C. Cerrone, R. Cerulli, and B. Golden. An Adaptive Heuristic Approachto Compute Upper and Lower Bounds for The Close-Enough Traveling SalesmanProblem. INFORMS Journal on Computing, 32(4):1030–1048, 2020.

[2] F. Carrabs, R. Cerulli, C. D’Ambrosio, and F. Laureana. The Generalized Mi-nimum Branch Vertices Problem: Properties and Polyhedral Analysis. Accep-ted for pubblication in Journal of Optimization Theory and Applications, doi:10.1007/s10957-020-01783-x, 2020.

[3] F. Carrabs, R. Cerulli, and A. Raiconi. A Reduction Heuristic For The All-ColorsShortest Path Problem. RAIRO, (in press). doi: 10.1051/ro/2020078, 2020.

[4] F. Carrabs, C. D’Ambrosio, D. Ferone, P. Festa, and F. Laureana. The Constrai-ned Forward Shortest Path Tour Problem: mathematical modeling and GRASPapproximate solutions. Accepted for pubblication in Networks, (in press). doi:10.1002/net.22010, 2020.

[5] F. Carrabs, C. D’Ambrosio, and A. Raiconi. Optimization of sensor battery chargingto maximize lifetime in a wireless sensors network. Optimization Letters, (in press).doi: 10.1007/s11590-020-01533-y, 2020.

[6] F. Carrabs and M. Gaudioso. A Lagrangian approach for the Minimum SpanningTree Problem with Conflicting Edge Pairs. Accepted for pubblication in Networks,(in press). doi: 10.1002/net.22009, 2020.

[7] Francesco Carrabs. A Biased Random-Key Genetic Algorithm for the Set Orien-teering Problem. European Journal of Operational Research, (in press). doi:https://doi.org/10.1016/j.ejor.2020.11.043, 2020.

[8] F. Carrabs, C. Cerrone, and R. Pentangelo. A multiethnic genetic approach for theminimum conflict weighted spanning tree problem. Networks, 74(2):134–147, 2019.

[9] F. Carrabs, R. Cerulli, G. Felici, and G. Singh. Exact approaches for the orderlycolored longest path problem: performance comparison. Computers & OperationsResearch, 101:275–284, 2019.

[10] R. Falcone, F. Carrabs, R. Cerulli, C. Lima, and E. Martinelli. Seismic retrofitting ofexisting RC buildings: a rational selection procedure based on Genetic Algorithms.Structures, 22:310 – 326, 2019.

[11] C. Archetti, F. Carrabs, and R. Cerulli. The Set Orienteering Problem. EuropeanJournal of Operational Research, 267(1):264–272, 2018.

[12] F. Carrabs, C. Cerrone, R. Cerulli, and S. Silvestri. The Rainbow Spanning ForestProblem. Soft Computing, 22(8):2765–2776, 2018.

[13] F. Carrabs, C. Cerrone, R. Cerulli, and S. Silvestri. On the complexity of rainbowspanning forest problem. Optimization Letters, 12(3):443–454, 2018.

[14] F. Carrabs, R. Cerulli, R. Pentangelo, and A. Raiconi. Minimum spanning tree withconflicting edge pairs: a branch-and-cut approach. Annals of Operations Research,doi: 10.1007/s10479-018-2895-y, 2018.

[15] F. Carrabs, R. Cerulli, R. Pentangelo, and A. Raiconi. A two-level metaheuristic forthe all colors shortest path problem. Computational Optimization and Applications,71(2):525–551, 2018.

[16] F. Carrabs, C. Cerrone, R. Cerulli, and M. Gaudioso. A Novel DiscretizationScheme for the Close Enough Traveling Salesman Problem. Computers & OperationsResearch, 78:163–171, 2017.

[17] F. Carrabs, R. Cerulli, C. D’Ambrosio, and A. Raiconi. An exact algorithm to extendlifetime through roles allocation in sensor networks with connectivity constraints.Optimization Letters, 11(7):1341–1356, 2017.

[18] F. Carrabs, R. Cerulli, C. D’Ambrosio, and A. Raiconi. Exact and heuristicapproaches for the maximum lifetime problem in sensor networks with coverageand connectivity constraints. RAIRO, 51(3):607–625, 2017.

[19] F. Carrabs, R. Cerulli, and A. Sciomachen. An Exact Approach for the GroceryDelivery Problem in Urban Areas. Soft Computing, 21(9):2439–2450, 2017.

[20] C. Franciosi, F. Carrabs, R. Cerulli, and S. Miranda. An evolutionary approach forthe offsetting inventory cycle problem. Cogent Engineering, 4(1), 2017.

[21] F. Carrabs, R. Cerulli, C. D’Ambrosio, and A. Raiconi. Extending Lifetime ThroughPartial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks.IFAC-PapersOnLine, 49(12):973–978, 2016.

[22] F. Carrabs, R. Cerulli, C. D’Ambrosio, M. Gentili, and A. Raiconi. Maximizinglifetime in wireless sensor networks with multiple sensor families. Computers &Operations Research, 60:121–137, 2015.

[23] F. Carrabs, R. Cerulli, C. D’Ambrosio, and A. Raiconi. A hybrid exact approachfor maximizing lifetime in sensor networks with complete and partial coverageconstraints. Journal of Network and Computer Applications, 58:12–22, 2015.

[24] F. Carrabs, C. Cerrone, and R. Cerulli. A Memetic Algorithm for the WeightedFeedback Vertex Set Problem. Networks, 64(4):339–356, 2014.

[25] F. Carrabs, R. Cerulli, M. Gaudioso, and M. Gentili. Lower and upper bounds forthe spanning tree with minimum branch vertices. Computational Optimization andApplications, 56(2):405–438, 2013.

[26] F. Carrabs, R. Cerulli, and M.G. Speranza. A branch-and-bound algorithm for thedouble travelling salesman problem with two stacks. Networks, 61(1):58–75, 2013.

[27] F. Carrabs, R. Cerulli, and M. Gentili. The Labeled Maximum Matching Problem.Computers & Operations Research, 36:1859–1871, 2009.

[28] F. Carrabs, R. Cerulli, and J.-F. Cordeau. An Additive Branch-and-Bound Algori-thm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFOLoading. INFOR, 45(4):223–238, 2007.

[29] F. Carrabs, J.-F. Cordeau, and G. Laporte. Variable Neighborhood Search for thePickup and Delivery Traveling Salesman Problem with LIFO Loading. INFORMSJournal On Computing, 19(4):618–632, 2007.

[30] F. Carrabs, R. Cerulli, M. Gentili, and G. Parlato. A Linear Time Algorithm forthe Minimum Weighted Feedback Vertex Set on Diamonds. Information ProcessingLetters, 94(1):29–35, 2005.

[31] F. Carrabs, R. Cerulli, M. Gentili, and G. Parlato. Minimum Weighted FeedbackVertex Set on Diamonds. Electronic Notes in Discrete Mathematics, 17:87–91, 2004.

Proceedings of Conferences with Review Process[32] F. Carrabs, R. Cerulli, C. D’Ambrosio, M. Gentili, and F. Della Croce. The

interval transportation problem with a cost matrix immune against the more-for-less paradox. In 18th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW), 2020.

[33] F. Carrabs, C. Cerrone, R. Cerulli, and C. D’Ambrosio. Improved Upper and LowerBounds for the Close Enough Traveling Salesman Problem. In Lecture Notes inComputer Science, volume 10232, pages 165–177, 2017.

[34] F. Carrabs, C. Cerrone, C. D’Ambrosio, and A. Raiconi. Column GenerationEmbedding Carousel Greedy for the Maximum Network Lifetime Problem withInterference Constraints. In Springer Proceedings in Mathematics and Statistics,volume 217, pages 151–159. Springer International Publishing, 2017.

[35] F. Carrabs, C. Cerulli, P. Festa, and F. Laureana. On the Forward Shortest PathTour Problem. In Springer Proceedings in Mathematics and Statistics, volume 217,pages 529–537. Springer International Publishing, 2017.

[36] F. Carrabs, R. Cerulli, C. D’Ambrosio, and A. Raiconi. Prolonging lifetime inwireless sensor networks with interference constraints. In Lecture Notes in ComputerScience, volume 10232, pages 285–297, 2017.

[37] F. Carrabs, C. Cerrone, and R. Cerulli. A tabu search approach for the circlepacking problem. In 17th International Conference on Network-Based InformationSystems, NBiS 2014, pages 165–171, 2014.

[38] F. Carrabs, R. Cerulli, and P. Dell’Olmo. A Mathematical Programming Approachfor the Maximum Labeled Clique Problem. In Procedia - Social and BehavioralSciences, volume 108, pages 69–78, 2014.

[39] F. Carrabs, R. Cerulli, and P. Dell’Olmo. The maximum labeled clique problem. In10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW2011), Proceedings of the Conference, pages 145–149, 2011.

[40] F. Carrabs, R. Cerulli, M. Gentili, and G. Parlato. A Tabu Search Heuristic basedon k-diamonds for the Weighted Feedback Vertex Set Problem. In Lecture Notes inComputer Science (INOC 2011), volume 6701, pages 589–602, 2011.

Book Chapter[41] F. Carrabs, R. Cerulli, C. D’Ambrosio, and A. Raiconi. Maximizing Lifetime for a

Zone Monitoring Problem Through Reduction to Target Coverage. In New Trendsin Emerging Complex Real Life Problems, AIRO Springer Series, volume 1, pages111–119. Springer International Publishing, 2018.

[42] F. Carrabs, R. Cerulli, and A. Sciomachen. Environmental Sustainable FleetPlanning in B2C e-Commerce Urban Distribution Networks. In Smart City, Progressin IS, pages 183–192. Springer International Publishing, 2014.

Submitted PapersF. Carrabs, R. Cerulli, C. D’Ambrosio, F. Della Croce, and M. Gentili. A newheuristic approach to solve the interval immune transportation problem. Submittedto Omega (second revision).

PrefacesF. Carrabs, R. Cerulli, and M. Gentili. Theoretical and algorithmic contributionsto network optimization problems. Networks, 71(4):325, 2018.

F. Carrabs, R. Cerulli, and M. Gaudioso. Application-motivated Nonlinear Pro-gramming. Journal of Optimization Theory and Applications, 164(3):731–732,2015.

Ph.D. ThesisF.Carrabs. Heuristics and exact approaches for transportation problems with pickupand delivery. PhD thesis, Dept. of Mathematics and Computer Science, Universityof Salerno, 2006.