Associate Professor
Department of Mathematics
University of Salerno

Phone:  +39 089 963326
Email:   fcarrabs@unisa.it

Short CV

Publications:

Journal
Proceedings
Preface

Teaching

Operations Research
Optimization

Institutional page

My links:

Scopus

Francesco Carrabs

Welcome to my research webpage. Here you can find a list of my downloadable papers, datasets, curriculum vitae and my link to Scopus, Google Scholar, Publons and Dblp.

Short CV

I am Associate Professor of Operational Research in the Department of Mathematics at the University of Salerno (ITALY).

I got my Laurea (cum laude) in Computer Science from the University of Salerno in 2002 and in 2006 I got the Ph.D. in Computer Science.
In 2005 and 2006 I have been a visiting student at the CRT (Centre de recherche sur les transports), University of Montreal doing research with Proff. G. Laporte and J-F. Cordeau. In 2007, I was a post-doc researcher at the HEC (École des Hautes Études Commerciales de Montréal) doing research with J-F. Cordeau. Since December 2008 I am Assistant Professor at the Department of Mathematics of the University of Salerno and I teach Operations Research and Optimization courses. In April 2017 I got the Italian National Scientific Habilitation to associate professor in Operations Research. Since 2018 I am Associate Editor of Soft Computing journal. Since 2020 I am Associate Professor at the Department of Mathematics of the University of Salerno.

The research activity is mainly devoted to the theoretical study, the development and the implementation of exact and heuristic approaches for the resolution of the optimization problems on graphs as: Routing problems, Variants of Spanning Tree Problems, Variants of Traveling Salesman Problem, Labeled Graph problems, Wireless Sensor Networks problems.

My complete curriculum vitae is available here: italian and english.

Publications

  1. Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP
    F.Carrabs, R.Cerulli, R. Mansini, L.Moreschin, D.Serra Computer & Operations Research , Vol. 166, pp. 106620, 2024.
    [Pdf] [View at Publisher] [DataSet and Source Code] [Bibtex]

  2. A New Formulation and a Branch-and-Cut Algorithm for the Set Orienteering Problem
    C.Archetti, F.Carrabs, R.Cerulli, F.Laureana, European Journal of Operational Research ,Vol. 314(2), pp. 446-465, 2024.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  3. A genetic approach for the 2-edge-connected minimum branch vertices problem
    F.Carrabs, R.Cerulli, F.Laureana, D.Serra, C.Sorgente, Networks ,Vol. 82(4), pp. 301-317, 2023.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  4. Artificial neural network for technical feasibility prediction of seismic retrofitting in existing RC structures
    R.Falcone, A.Ciaramella, F.Carrabs, N.Strisciuglio, E.Martinelli, Structures , Vol. 41, pp. 1220-1234, 2022.
    [Pdf] [View at Publisher] [Bibtex]

  5. A Biased Random-Key Genetic Algorithm for the Set Orienteering Problem
    Francesco Carrabs, European Journal of Operational Research , Vol. 292(3), pp. 830-854, 2021.
    [Pdf] [View at Publisher] [DataSet] [DetailedResults] [Bibtex]

  6. An improved heuristic approach for the interval immune transportation problem
    F. Carrabs, R. Cerulli, C. D’Ambrosioa, F. Della Croce, M. Gentili, Omega , Vol. 104, 2021.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  7. The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis
    F. Carrabs, R. Cerulli, C. D'Ambrosio, F. Laureana, Journal of Optimization Theory and Applications , Vol. 188, pp. 356–377, 2021.
    [Pdf] [View at Publisher] [Bibtex]

  8. A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
    F. Carrabs, M. Gaudioso, Networks , Vol. 78(1), pp. 32-45, 2021.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  9. Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach.
    F. Carrabs, R. Cerulli, R. Pentangelo, A. Raiconi, Annals of Operations Research, Vol. 298, pp. 65–78, 2021.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  10. A reduction heuristic for the all-colors shortest path problem
    F. Carrabs, R. Cerulli, and A. Raiconi, RAIRO , Vol. 55, pp. 2071-2082, 2021.
    [Pdf] [View at Publisher] [Bibtex]

  11. The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
    F. Carrabs, C. D’Ambrosioa, D. Ferone, P. Festa, F. Laureana, Networks , Vol. 78(1), pp. 17-31, 2021.
    [Pdf] [View at Publisher] [Bibtex]

  12. Optimization of sensor battery charging to maximize lifetime in a wireless sensors network
    F. Carrabs, C. D’Ambrosio, and A. Raiconi, Optimization Letters, Vol.15(5), pp. 1587–1600, 2021.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  13. An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
    F. Carrabs, C. Cerrone, R. Cerulli, B. Golden, INFORMS Journal on Computing, Vol. 32(4), pp. 1030–1048, 2020.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  14. Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms
    R. Falcone, F. Carrabs, R. Cerulli, C. Lima, E. Martinelli, Structures , Vol. 22, pp. 310-326, 2019.
    [Pdf] [View at Publisher] [Bibtex]

  15. A multiethnic genetic approach for the minimum conflict weighted spanning tree problem
    F. Carrabs, C. Cerrone, R. Pentangelo, Networks , Vol. 74(2), pp. 134-147, 2019.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  16. Exact approaches for the orderly colored longest path problem: performance comparison.
    F. Carrabs, R. Cerulli, G. Felici, G. Singh, Computers & Operations Research, Vol. 101, pp. 275-284, 2019.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  17. A two-level metaheuristic for the all colors shortest path problem.
    F. Carrabs, R. Cerulli, R. Pentangelo, A. Raiconi, Computational Optimization and Applications, Vol. 71, pp. 525–551, 2018.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  18. The Set Orienteering Problem.
    C. Archetti, F. Carrabs and R. Cerulli, European Journal of Operational Research, Vol. 267(1), pp. 264-272, 2018.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  19. The rainbow spanning forest problem.
    F. Carrabs, C. Cerrone, R. Cerulli, and S. Silvestri, Soft Computing, Vol. 22(8), pp. 2765-2776, 2018.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  20. On the complexity of rainbow spanning forest problem.
    F. Carrabs, C. Cerrone, R. Cerulli, and S. Silvestri, Optimization Letters, Vol. 12(3), pp. 443-454, 2018.
    [Pdf] [View at Publisher] [Bibtex]

  21. Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints.
    F. Carrabs, R. Cerulli, C. D’Ambrosio, and A. Raiconi, RAIRO - Operations Research, Vol. 51(3), pp. 607-625, 2017.
    [Pdf] [View at Publisher] [Bibtex]

  22. An evolutionary approach for the offsetting inventory cycle problem.
    C. Franciosi, F. Carrabs, R. Cerulli, S. Miranda, Cogent Engineering, Vol. 4(1), 2017.
    [Pdf] [View at Publisher] [Bibtex]

  23. A Novel Discretization Scheme for the Close Enough Traveling Salesman Problem.
    F. Carrabs, C. Cerrone, R. Cerulli, M. Gaudioso, Computers & Operations Research, Vol. 78, pp. 163–171, 2017.
    [Pdf] [View at Publisher] [Bibtex]

  24. An exact approach for the grocery delivery problem in urban areas.
    F. Carrabs, R. Cerulli, A. Sciomachen, Soft Computing, Vol. 21(9), pp. 2439–2450, 2017.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  25. An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints.
    F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi, Optimization Letters, Vol. 11(7), pp. 1341–1356, 2017.
    [Pdf] [View at Publisher] [Bibtex]

  26. Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks.
    F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi, IFAC-PapersOnLine, Vol. 49(12), pp. 973-978, Troyes, France, 28-30 June 2016.
    [Pdf] [View at Publisher] [Bibtex]

  27. A Hybrid Exact Approach for Maximizing Lifetime in Sensor Networks with Complete and Partial Coverage Constraints.
    F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi, Journal of Networking and Computer Applications. Vol. 58, pp. 12-22, 2015.
    [Pdf] [View at Publisher] [Bibtex]

  28. Maximizing Lifetime in Wireless Sensor Networks with Multiple Sensor Families.
    F. Carrabs, R. Cerulli, C. D’Ambrosio, M. Gentili, A. Raiconi, Computers & Operations Research Vol. 60, pp. 121–137, 2015.
    [Pdf] [View at Publisher] [Bibtex]

  29. A Memetic Algorithm for the Weighted Feedback Vertex Set Problem.
    F. Carrabs, C. Cerrone, R. Cerulli, Networks. Vol. 64(4), pp. 339–356, 2014.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  30. Lower and upper bounds for the spanning tree with minimum branch vertices.
    F. Carrabs, R. Cerulli, M. Gaudioso, M. Gentili, Computational Optimization and Applications, Vol. 56(2), pp. 405-438, 2013.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  31. A Branch-and-Bound Algorithm for the Double TSP with Two Stacks.
    F. Carrabs, R. Cerulli, M. Grazia Speranza, Networks, Vol. 61(1), pp. 58-75, 2013.
    [Pdf] [View at Publisher] [Bibtex]

  32. The Labeled Maximum Matching Problem.
    F. Carrabs, R. Cerulli, M. Gentili, Computers & Operations Research, Vol. 36(6), pp. 1859-1871, 2009.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  33. An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading..
    F. Carrabs, R. Cerulli, J.F. Cordeau, INFOR Information Systems and Operational Research, Vol. 45(4), pp. 223-238, 2007.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  34. Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading.,
    F. Carrabs, J.F. Cordeau, G. Laporte, INFORMS Journal On Computing, Vol. 19(4), pp. 618-632, 2007.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  35. A Linear Time Algorithm for the Minimum Weighted Feedback Vertex Set on Diamonds.
    F. Carrabs, R. Cerulli, M. Gentili, G. Parlato, Information Processing Letters, Vol. 94(1), pp. 29-35, 2005.
    [Pdf] [View at Publisher] [Bibtex]

  36. Minimum Weighted Feedback Vertex Set on Diamonds.
    F. Carrabs, R. Cerulli,M. Gentili, G. Parlato, Electronic Notes in Discrete Mathematics , Vol. 17, pp. 87-91, 2004.
    [Pdf] [View at Publisher] [Bibtex]


    37. Peer Reviewed Conference Proceeding Articles

  37. Maximizing lifetime for a zone monitoring problem though reduction to target coverage.
    F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi, In New Trends in Emerging Complex Real Life Problems, pp. 111-119. Springer International Publishing, 2018.
    [Pdf] [View at Publisher] [Bibtex]

  38. Column Generation Embedding Carousel Greedy for the Maximum Network Lifetime Problem with Interference Constraints.
    F. Carrabs, C. Cerrone, C. D'Ambrosio and A. Raiconi, Springer Proceedings in Mathematics and Statistics (ODS 2017), Vol. 217, pp. 151-159, 2017.
    [Pdf] [View at Publisher] [Bibtex]

  39. On the Forward Shortest Path Tour Problem.
    F. Carrabs, R. Cerulli, P. Festa and F. Laureana, Springer Proceedings in Mathematics and Statistics (ODS 2017), Vol. 217, pp. 529-537, 2017.
    [View at Publisher] [Bibtex]

  40. Improved upper and lower bounds for the close enough traveling salesman problem.
    F. Carrabs, C. Cerrone, R. Cerulli, and C. D’Ambrosio, Lecture Notes in Computer Science, Vol. 10232, pp. 165-177, 2017.
    [Pdf] [View at Publisher] [Bibtex]

  41. Prolonging lifetime in wireless sensor networks with interference constraints.
    F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi, Lecture Notes in Computer Science, Vol. 10232, pp. 285-297, 2017.
    [Pdf] [View at Publisher] [Bibtex]

  42. Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution Networks.
    F. Carrabs, R. Cerulli, A. Sciomachen, Smart City, Progress in IS, pp. 183-192, 2014.
    [Pdf] [View at Publisher] [Bibtex]

  43. A Tabu Search Approach for the Circle Packing Problem.
    F. Carrabs, C. Cerrone, R. Cerulli, Network-Based Information Systems (NBiS 2014) pp.165-171, 2014.
    [Pdf] [View at Publisher] [Bibtex]

  44. A mathematical programming approach for the maximum labeled clique problem.
    F. Carrabs, R. Cerulli, P. Dell'Olmo, Procedia, Vol. 108, pp. 69–78, 2014.
    [Pdf] [View at Publisher] [Bibtex]

  45. A Tabu Search Heuristic based on k-diamonds for the Weighted Feedback Vertex Set Problem.
    F. Carrabs, R. Cerulli, M.Gentili, G. Parlato, Lecture Notes in Computer Science. (INOC 2011), Vol. 6701, pp. 589-602, 2011.
    [Pdf] [View at Publisher] [DataSet] [Bibtex]

  46. The maximum labeled clique problem.
    F. Carrabs, R. Cerulli, P. Dell’Olmo, In 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011), pp. 145-149, Frascati, Italy, June 14-16, 2011.

  47. Random Neighborhood Selection for the Vehicle Routing Problem with Time Windows.
    F. Carrabs, R. Cerulli, M. Gentili, In Proceedings of the Fifth Triennial Symposium on Transportation Analysis (Tristan V), Freville, A., Gendreau, M., and Semet, F. (Eds.), Guadeloupe, French West Indies, June 13-18, 2004.


    48. Prefaces

  48. Theoretical and algorithmic contributions to network optimization problems.
    F. Carrabs, R. Cerulli, M. Gentili, Networks , 71(4):325, 2018.
    [View at Publisher]

  49. Application-motivated nonlinear programming.
    F. Carrabs, R. Cerulli, M. Gaudioso, Journal of Optimization Theory and Applications , 164(3):731–732, 2015.
    [View at Publisher]

Teaching