CERULLI, Raffaele
CERULLI, Raffaele
Dipartimento di Matematica/DIPMAT
A biased random-key genetic algorithm for the knapsack problem with forfeit sets
2024-01-01 Cerulli, R.; D'Ambrosio, C.; Raiconi, A.
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
2017-01-01 Silvestri, Selene; Laporte, Gilbert; Cerulli, Raffaele
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
2013-01-01 Carrabs, Francesco; Cerulli, Raffaele; Maria Grazia, Speranza
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows
2006-01-01 Carrabs, Francesco; Cerulli, Raffaele; Gentili, Monica
A Dual Ascent Approach to the Bounded-Degree Spanning Tree Problem
2007-01-01 Gentili, Monica; Cerulli, Raffaele; Manlio, Gaudioso
A Flow Formulation for the Close-Enough Arc Routing Problem
2017-01-01 Cerrone, Carmine; Cerulli, Raffaele; Golden, Bruce; Pentangelo, Rosa
A genetic approach for the 2-edge-connected minimum branch vertices problem
2023-01-01 Carrabs, F.; Cerulli, R.; Laureana, F.; Serra, D.; Sorgente, C.
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints
2015-01-01 Carrabs, Francesco; Cerulli, Raffaele; D'Ambrosio, Ciriaco; Raiconi, Andrea
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds
2005-01-01 Carrabs, Francesco; Cerulli, Raffaele; Gentili, Monica; Parlato, G.
A Mathematical Programming Approach for the Maximum Labeled Clique Problem
2014-01-01 Carrabs, Francesco; Cerulli, Raffaele; P., Dell’Olmo
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem
2014-01-01 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele
A multiplier adjustment technique for the concentrator location problem
1998-01-01 Cerulli, Raffaele; Gaudioso, M; Sergeyev, Y. A. D.
A new formulation and a branch-and-cut algorithm for the set orienteering problem
2024-01-01 Archetti, C.; Carrabs, F.; Cerulli, R.; Laureana, F.
A new forward backward Auction algorithm
1999-01-01 Cerulli, Raffaele; P., Festa; Raiconi, Giancarlo
A novel discretization scheme for the close enough traveling salesman problem
2017-01-01 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele; Gaudioso, Manlio
A reduction heuristic for the all-colors shortest path problem
2021-01-01 Carrabs, Francesco; Cerulli, Raffaele; Raiconi, Andrea
A Tabu Search Approach for the Circle Packing Problem
2014-01-01 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
2011-01-01 Carrabs, Francesco; Cerulli, Raffaele; Gentili, Monica; Gennaro, Parlato
A two-level metaheuristic for the all colors shortest path problem
2018-01-01 Carrabs, F.; Cerulli, R.; Pentangelo, R.; Raiconi, A.
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
2020-01-01 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele; Golden, Bruce