Raffaele Cerulli

Professor

University of Salerno

Italy

Research Interests

Explore related searches

Professors in Italy

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

About

Professor Raffaele Cerulli is a faculty member at the University of Salerno, Italy. His research interests include algorithmic approaches to combinatorial optimization problems, with recent work focusing on topics such as flow problems with conflict constraints, the cluster deletion problem in general graphs, and medical history classification using granular computing. Additionally, he has explored genetic algorithms and GRASP methodologies in various combinatorial contexts.

Articles (12)

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2022

Year:

2021

Year:

2021

Year:

2020

Collaborators (4)

Francesca Guerriero

Full Professor

University of Calabria

ITALY

View details

Carmine Sorgente

ITALY

View details

Francesco Carrabs

Associate Professor

Università degli Studi di Napoli Federico II

ITALY

View details

Santos Sanchez-Cambronero

Profesor Titular de Universidad

University of Castilla-La Mancha

SPAIN

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Raffaele Cerulli

Research Interests

Explore related searches

Contact this professor

About

Articles (12)

Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints

Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs

Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP

Improving patient’s medical history classification using a feature construction approach based on situation awareness and granular computing

A biased random-key genetic algorithm for the knapsack problem with forfeit sets

The Budgeted Labeled Minimum Spanning Tree Problem

Shortest paths with exclusive-disjunction arc pairs conflicts

A genetic approach for the 2‐edge‐connected minimum branch vertices problem

An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation

Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach

A reduction heuristic for the all-colors shortest path problem

An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem

Collaborators (4)

Francesca Guerriero

Carmine Sorgente

Francesco Carrabs

Santos Sanchez-Cambronero

Make your next move.