Raffaele Cerulli

Cerulli Raffaele

Raffaele Cerulli

Cerulli

TSP

FVS

Associate Professor

Phone: +39 089 968232
Phone: +39 089 963326
Fax: +39 089 963303

Department of Mathematics,
University of Salerno,
Via Ponte Don Melillo 1, Fisciano (SA), ITALY
Email: raffaele@unisa.it
Orcid ID: http://orcid.org/0000-0002-3277-6802

Web: http://www.orgroup.dmi.unisa.it/cerulli/


  Current Position

I am Associate Professor of Operational Research at the "Dipartimento di Matematica ed Informatica" of the University of Salerno (ITALY).
My complete curriculum vitae is available here: italian and english.

    International Journals (Google Citations)

  1. S.Silvestri, G.Laporte, R.Cerulli,
    The Rainbow Cycle Cover Problem.
    Networks ,to appear. [View at Publisher][DataSet]
  2. S.Silvestri, G.Laporte, R.Cerulli,
    A Branch-and-Cut Algorithm for the Minimum Branch Vertices Spanning Tree Problem.
    Computers & Operations Research ,submitted. [View at Publisher]
  3. F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi,
    A Hybrid Exact Approach for Maximizing Lifetime in Sensor Networks with Complete and Partial Coverage Constraints.
    Journal of Networking and Computer Applications. Vol.58, pp. 12-22, 2015. [View at Publisher][Bibtex]
  4. F. Carrabs, R. Cerulli, C. D’Ambrosio, M. Gentili, A. Raiconi,
    Maximizing Lifetime in Wireless Sensor Networks with Multiple Sensor Families.
    Computers & Operations Research Vol. 60, pp.121–137, 2015. [View at Publisher][Bibtex]
  5. F. Carrabs, C. Cerrone, R. Cerulli,
    A Tabu Search Approach for the Circle Packing Problem.
    Network-Based Information Systems (NBiS) pp. 165-171, 2014. [View at Publisher][Bibtex]
  6. F. Carrabs, C. Cerrone, R. Cerulli,
    A Memetic Algorithm for the Weighted Feedback Vertex Set Problem.
    Networks. Vol.64(4), pp. 339–356, 2014. [View at Publisher][DataSet][Bibtex]
  7. F. Carrabs, R. Cerulli, A. Sciomachen
    Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution Networks.
    Smart City, Progress in IS, pp. 183-192, 2014. [View at Publisher][Bibtex]
  8. F. Carrabs, R. Cerulli, P. Dell'Olmo,
    A mathematical programming approach for the maximum labeled clique problem.
    Procedia, Vol. 108, pp. 69–78, 2014. [View at Publisher][Bibtex]
  9. R.Cerulli, R.Deleone, M.Gentili,
    Finding Pattern Configurations for Bank Cheque Printing.
    Procedia, Vol. 108, pp. 219–234, 2014. [View at Publisher][Bibtex]
  10. R.Cerulli, A.Fink, M.Gentili, A.Raiconi,
    The k-labeled Spanning Forest Problem.
    Procedia, Vol. 108, pp. 153–163, 2014. [View at Publisher][Bibtex]
  11. C. Cerrone, R. Cerulli, A. Raiconi,
    Relations, Models and a Memetic Approach for Three Degree-Dependent Spanning Tree Problems.
    European Journal of Operational Research 232 (3), 442-453, 2014. [View at Publisher][Bibtex]
  12. F. Carrabs, R. Cerulli, M. Gaudioso, M. Gentili,
    Lower and upper bounds for the spanning tree with minimum branch vertices.
    Computational Optimization and Applications, Vol. 56(2), pp.405-438, 2013. [View at Publisher][DataSet][Bibtex]
  13. J. Silberholz, A. Raiconi, R. Cerulli, M. Gentili, B. Golden, S. Chen,
    Comparison of Heuristics for the Colorful Traveling Salesman Problem.
    International Journal of Metaheuristics, Volume 2 Issue 2, Pages 141-173, May 2013. [View at Publisher]
  14. F. Carrabs, R. Cerulli, M. Grazia Speranza,
    A Branch-and-Bound Algorithm for the Double TSP with Two Stacks.
    Networks, Vol. 61(1), pp.58-75, 2013. [View at Publisher][Bibtex]
  15. R. Cerulli, R. De Donato, A. Raiconi,
    Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges.
    . European Journal of Operational Research, 220 (1) , pp. 58-66, 2012.[View at Publisher][Bibtex]
  16. F. Carrabs, R. Cerulli, M.Gentili, G. Parlato,
    A Tabu Search Heuristic based on k-diamonds for the Weighted Feedback Vertex Set Problem .
    Lecture Notes in Computer Science. (INOC 2011), Vol.6701, pp.589-602, 2011. [View at Publisher][DataSet][Bibtex]
  17. F. Carrabs, R. Cerulli,M. Gentili,
    The Labeled Maximum Matching Problem.
    Computers & Operations Research, Vol.36(6), pp.1859-1871, 2009. [View at Publisher][DataSet] [Bibtex]
  18. R. Cerulli, M. Gentili, A. Iossa,
    Bounded-degree spanning tree problems: Models and new algorithms.
    Computational Optimization and Applications, Vol.42 (3) , pp. 353-370, 2009.[View at Publisher][Bibtex]
  19. R. CerulliR., M. Gentili, A. Iossa, "Efficient Preflow-push Algorithms", Computers and Operations Research, 35(8), pp. 2694-2708, 2008.
  20. F. Carrabs, R.Cerulli, J.F. Cordeau,
    An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading.
    INFOR Information Systems and Operational Research, Vol.45(4), pp.223-238, 2007. [View at Publisher][DataSet][Bibtex]
  21. R. Cerulli, P. Dell’Olmo, M. Gentili, A. Raiconi, “Heuristic Approaches for the Minimum Labelling Hamiltonian Cycle Problem”, Electronics Notes in Discrete Mathematics, 25 (2006) 131- 138. [DATA]
  22. R. Cerulli, A. Fink, M. Gentili, S. Voss, "Extensions of the Minimum Labelling Spanning Tree Problem", Journal of Telecommunications and Information Technology, 4 (2006) 39-45. [DATA1] [DATA2] [README]
  23. R. Cerulli, M. Gentili, A. Iossa, “Experimental Comparison of Algorithms for Bounded-Degree Spanning Tree Problem’’, accepted for publication on Computational Optimization and Applications.
  24. F. Carrabs, R. Cerulli, M. Gentili, G. Parlato,
    A Linear Time Algorithm for the Minimum Weighted Feedback Vertex Set on Diamonds,
    Information Processing Letters, Vol.94(1), pp.29-35, 2005. [View at Publisher][Bibtex]
  25. F. Carrabs, R. Cerulli, M.Gentili, G.Parlato.
    Minimum Weighted Feedback Vertex Set on Diamonds,
    Electronic Notes in Discrete Mathematics. Vol.17, pp.87-91, 2004. [View at Publisher][Bibtex]
  26. R. Cerulli, P. Festa, G. Raiconi, “Shortest path auction algorithm without contractions using virtual source concept’’, Computational Optimization and Applications, 26, 2 (2003), 191-208.
  27. R. Cerulli, P. Festa, G. Raiconi, “Graph collapsing in shortest path Auction algorithms’’, Computational Optimization and Applications, 18, (2001), 199-220.
  28. R. Cerulli, P. Festa, G. Raiconi, G. Visciano, “ The Auction technique for the sensor based navigation planning of an autonomous mobile robot’’, Journal of Intelligent and Robotic Systems, 21 (1998), 373-395.
  29. R. Cerulli, M. Gaudioso, Y.A.D. Sergeyev, "A multiplier adjustment technique for the concentrator location problem", Optimization Methods and Software,10 (1998), 87-102.
  30. R. Cerulli, R. De Leone, G. Piacente, "A modified Auction algorithm for the shortest path problem", Optimization Methods and Software, 4 (1994), 209-224.
  31. R. Cerulli, M. Gaudioso, R. Mautone, “A Class of Manpower scheduling Problems’’, Zeitschrift Fuer Operations Research, 36 (1990), 93-105.
  32. R. Cerulli, M. Gaudioso, "Mean-variance approach to the management of cyclic deliveries", Computers & Operations Research, 15, 6 (1988), 561-565.
  33. Articles in book

  34. R. Cerulli, D. Granata, A. Raiconi, M.G. Scutellà,
    Maximum Flow Problems and an NP-complete variant on Edge Labeled Graphs.
    P.M. Pardalos, D. Ding-Zhu and R.L. Graham (Eds.), Handbook of Combinatorial Optimization, 2nd Edition, Springer, 1913-1948, 2013. [View at Publisher]
  35. R. Cerulli, A. Fink, M. Gentili, S. Voß,
    Metaheuristics comparison for the minimum labelling spanning tree problem.
    In: B.L. Golden, S. Raghavan and E.A. Wasil (eds.)The Next Wave on Computing, Optimization, and Decision Technologies, Springer, New York (2005), 93 - 106. [ISBN: 0-387-23528-0]. [View at Publisher]
  36. R. Cerulli, P. Festa, G. Raiconi,
    Complexity and experimental evaluation of primal-dual shortest path tree algorithms.
    In:Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, P.M. Pardalos, (ed), Kluwer Academic Publishers (2000).[View at Publisher]
  37. R. Cerulli, P. Festa, G. Raiconi,
    A new forward backward Auction algorithm.
    In: High Performance Algorithms and Software in Nonlinear Optimization, R. De Leone et al., (eds.), Kluwer Academic Publishers (1999). [View at Publisher]
  38. Proceedings of Conferences with Review Process

  39. F. Carrabs, R. Cerulli, and P.Dell’Olmo.
    The maximum labeled clique problem.
    In 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011), Proceedings of the Conference, pages 145–149, Frascati, Italy, June 14-16, 2011.
  40. F. Carrabs, R. Cerulli, M. Gentili.
    Random Neighborhood Selection for the Vehicle Routing Problem with Time Windows.
    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.
  41. R. Cerulli, P. Festa, G. Raiconi.
    Shortest path in randomly time varying networks.
    In Proceedings of the 4th International IEEE Conference on Intelligent Transportation Systems (2001).
  42. R. Cerulli, P. Festa, G. Raiconi.
    Shortest path in randomly time varying networks.
    In “Rendezvous of mobile robots in unknown environment via graph optimization approach’’, Proceedings of ECC99 - 5° European Control Conference (1999).
  43. R. Cerulli, P. Festa, G. Raiconi.
    Rendezvous of mobile robots in unknown environment via graph optimization approach.
    In Proceedings of ECC99 - 5° European Control Conference (1999).
  44. R. Cerulli, P. Festa, G. Raiconi.
    Vehicle Routing Problem in Optimal Warehouse Management for Flexible Manufacturing Plants.
    In Proceedings of the Second World Manufacturing Congress (1999), 160-166.
  45. R. Cerulli, P. Festa, G. Raiconi.
    Network optimization for sensor based robotic navigation with moving obstacles.
    In Proceedings of the IFAC Symposium on Intelligent Autonomous Vehicles IAV98 (1998), 376-382.
  46. L.Bianco, R.Cerulli, M.Gentili,
    New Resolution Approaches for the Sensor Location problem.
    In Proceedings of the Eighth Triennial Symposium on Transportation Analysis (Tristan V), 10-15 June 2007, Phuket Island, Thailand.
  47. R. Cerulli, C. Duin, M. Fernandes, A. Fink, M. Gentili, L. Gouveia, S. Voß,
    Applications of the Pilot Method to hard modifications of the minimum spanning tree problem.
    In Proceedings 18th MINI EURO conference on VNS (2005).
  48. R. Cerulli, A. Fink, M. Gentili, S. Voß,
    Variable Neighbourhood Search for the Labeling Spanning Tree Problem.
    IFORS Conference, Honolulu, Hawaii, July 2005.
  49. Technical Reports

  50. Francesco Carrabs, Raffaele Cerulli, Ciriaco D’Ambrosio, Andrea Raiconi,
    An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints.
    Technical Report N.63994, Department of Mathematics, University of Salerno, 2015.[Results]
  51. Francesco Carrabs, Raffaele Cerulli, Anna Sciomachen
    Vehicle distribution plans for e-channel b2c grocery delivery in urban areas
    Submitted.[DataSet]
  52. Francesco Carrabs, Raffaele Cerulli, Ciriaco D’Ambrosio, Andrea Raiconi,
    Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints.
    Technical Report N.50811, Department of Mathematics, University of Salerno, 2015.
  53. F. Carrabs, R. Cerulli, M. Gentili, F. Maione,
    A new generic algorithm for multi-source shortest path problem.
    Technical Report N.3232, Department of Mathematics, University of Salerno, 2011.
  54. F. Carrabs, R. Cerulli, M. Gentili,
    Two Improving Strategies for the Vehicle Routing Problem with Time Windows.
    Technical Report, Department of Mathematics and Computer Science, University of Salerno, 2006.
  55. F. Carrabs, R. Cerulli,
    Graph generators for Spt Algorithms.
    Technical Report N.15, Department of Mathematics and Computer Science, University of Salerno, 2003.
  56. F. Carrabs, R. Cerulli,
    Shortest path tree problem: algorihms and data structures.
    Technical Report. N.16, Department of Mathematics and Computer Science, University of Salerno, 2003
  57. R. Cerulli, A. Losi,
    A comparison between sequential gradient-restoration algorithm and Han-Powell algorithm for mathematical programming problems.
    AERO-ASTRONAUTICS Technical Report, n° 225 (1987), Rice University, Houston.
  58. R. Cerulli, R.De Leone, M. Gaudioso,
    Balanced solution to a class of generalized set covering.
    Technical Report, n° 969 (1990), University of Wisconsin-Madison, Computer Sciences Department.