Francesco Carrabs

Francesco Carrabs is a Full Professor of Operations Research in the Department of Mathematics at the University of Salerno, Italy, a position he has held since 2024. Previously, he served as Associate Professor (2020-2024) and Assistant Professor (2008-2020) at the same institution, demonstrating a steady progression through the academic ranks.

Dr. Carrabs earned his PhD in Computer Science from the University of Salerno in 2006 and graduated cum laude in Computer Science from the same university in 2002. His international research experience includes a visiting scholar position at the Centre de recherche sur les transports (CRT) at the University of Montréal, Canada (2004-2006) under Professors Gilbert Laporte and Jean-François Cordeau, followed by a post-doctoral fellowship at HEC Montréal (October 2006-March 2007).

His research focuses on theoretical study, development and implementation of exact and heuristic approaches for optimization problems on graphs. His primary research areas include Routing problems, Variants of Spanning Tree problems, Traveling Salesman Problems, Labeled Graph problems, and Wireless Sensor Networks problems. This program has resulted in approximately 50 publications across various formats.

His recent publications reveal a strong emphasis on constrained graph problems, particularly those involving conflict constraints in spanning trees and set covering problems. His methodological contributions span exact approaches like branch-and-cut algorithms and heuristic methods including GRASP and genetic algorithms, often accompanied by publicly available datasets and source code.

Dr. Carrabs has participated in numerous national and international research projects and has served on scientific committees for various conferences. His teaching activities at the University of Salerno focus on Operations Research and Optimization courses within the SSD MATH-06/A classification.

With an h-index of 16 and over 800 citations (excluding approximately 13% self-citations), Dr. Carrabs has established himself as a respected researcher in combinatorial optimization and operations research.