Carmine Cerrone
Carmine Cerrone
Email verificata su unige.it - Home page
Titolo
Citata da
Citata da
Anno
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
482017
Carousel greedy: a generalized greedy algorithm with applications in optimization
C Cerrone, R Cerulli, B Golden
Computers & Operations Research 85, 97-112, 2017
462017
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
432014
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
352015
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
312014
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
202017
Omega one multi ethnic genetic approach
C Cerrone, R Cerulli, M Gaudioso
Optimization Letters 10 (2), 309-324, 2016
192016
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
142014
Multi-period street scheduling and sweeping
C Cerrone, B Dussault, B Golden, E Wasil
International Journal of Metaheuristics 3 (1), 21-58, 2014
132014
A memetic algorithm for the weighted feedback vertex set problem
F Carrabs, C Cerrone, R Cerulli
Networks 64 (4), 339-356, 2014
122014
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem
F Carrabs, C Cerrone, R Pentangelo
Networks 74 (2), 134-147, 2019
112019
The rainbow spanning forest problem
F Carrabs, C Cerrone, R Cerulli, S Silvestri
Soft Computing 22 (8), 2765-2776, 2018
112018
Improved upper and lower bounds for the close enough traveling salesman problem
F Carrabs, C Cerrone, R Cerulli, C D’Ambrosio
International conference on green, pervasive, and cloud computing, 165-177, 2017
102017
A flow formulation for the close-enough arc routing problem
C Cerrone, R Cerulli, B Golden, R Pentangelo
International Conference on Optimization and Decision Science, 539-546, 2017
92017
Column generation embedding carousel greedy for the maximum network lifetime problem with interference constraints
F Carrabs, C Cerrone, C D’Ambrosio, A Raiconi
International Conference on Optimization and Decision Science, 151-159, 2017
92017
On the complexity of rainbow spanning forest problem
F Carrabs, C Cerrone, R Cerulli, S Silvestri
Optimization Letters 12 (3), 443-454, 2018
82018
Heuristics for the strong generalized minimum label spanning tree problem
C Cerrone, C D'Ambrosio, A Raiconi
Networks 74 (2), 148-160, 2019
72019
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
52020
OAR Lib: An open source arc routing library
O Lum, B Golden, E Wasil
Mathematical Programming Computation 11 (3), 587-629, 2019
52019
A two-stage solution approach for the directed rural postman problem with turn penalties
C Cerrone, B Dussault, X Wang, B Golden, E Wasil
European Journal of Operational Research 272 (2), 754-765, 2019
52019
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20