Follow
Carmine Cerrone
Title
Cited by
Cited by
Year
Carousel greedy: A generalized greedy algorithm with applications in optimization
C Cerrone, R Cerulli, B Golden
Computers & Operations Research 85, 97-112, 2017
782017
A novel discretization scheme for the close enough traveling salesman problem
F Carrabs, C Cerrone, R Cerulli, M Gaudioso
Computers & Operations Research 78, 163-171, 2017
652017
Vehicle-id sensor location for route flow recognition: Models and algorithms
C Cerrone, R Cerulli, M Gentili
European Journal of Operational Research 247 (2), 618-629, 2015
482015
Locating sensors to observe network arc flows: exact and heuristic approaches
L Bianco, C Cerrone, R Cerulli, M Gentili
Computers & Operations Research 46, 12-22, 2014
482014
Relations, models and a memetic approach for three degree-dependent spanning tree problems
C Cerrone, R Cerulli, A Raiconi
European Journal of Operational Research 232 (3), 442-453, 2014
372014
Partitioning a street network into compact, balanced, and visually appealing routes
O Lum, C Cerrone, B Golden, E Wasil
Networks 69 (3), 290-303, 2017
272017
Omega one multi ethnic genetic approach
C Cerrone, R Cerulli, M Gaudioso
Optimization Letters 10 (2), 309-324, 2016
242016
A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance
A Di Placido, C Archetti, C Cerrone
Computers & Operations Research 145, 105831, 2022
192022
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 32 (4), 1030-1048, 2020
182020
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem
F Carrabs, C Cerrone, R Pentangelo
Networks 74 (2), 134-147, 2019
182019
The rainbow spanning forest problem
F Carrabs, C Cerrone, R Cerulli, S Silvestri
Soft Computing 22, 2765-2776, 2018
182018
Improved upper and lower bounds for the close enough traveling salesman problem
F Carrabs, C Cerrone, R Cerulli, C D’Ambrosio
Green, Pervasive, and Cloud Computing: 12th International Conference, GPC …, 2017
182017
A tabu search approach for the circle packing problem
F Carrabs, C Cerrone, R Cerulli
2014 17th International conference on network-based information systems, 165-171, 2014
182014
Heuristics for the strong generalized minimum label spanning tree problem
C Cerrone, C D'Ambrosio, A Raiconi
Networks 74 (2), 148-160, 2019
162019
Multi-period street scheduling and sweeping
C Cerrone, B Dussault, B Golden, E Wasil
International Journal of Metaheuristics 3 (1), 21-58, 2014
152014
Grocery distribution plans in urban networks with street crossing penalties
C Cerrone, R Cerulli, A Sciomachen
Networks 78 (3), 248-263, 2021
142021
On the complexity of rainbow spanning forest problem
F Carrabs, C Cerrone, R Cerulli, S Silvestri
Optimization Letters 12, 443-454, 2018
142018
A memetic algorithm for the weighted feedback vertex set problem
F Carrabs, C Cerrone, R Cerulli
Networks 64 (4), 339-356, 2014
142014
Column generation embedding carousel greedy for the maximum network lifetime problem with interference constraints
F Carrabs, C Cerrone, C D’Ambrosio, A Raiconi
Optimization and Decision Science: Methodologies and Applications: ODS …, 2017
132017
A flow formulation for the close-enough arc routing problem
C Cerrone, R Cerulli, B Golden, R Pentangelo
Optimization and Decision Science: Methodologies and Applications: ODS …, 2017
122017
The system can't perform the operation now. Try again later.
Articles 1–20