Segui
Carrabs Francesco
Titolo
Citata da
Citata da
Anno
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
F Carrabs, JF Cordeau, G Laporte
INFORMS Journal on Computing 19 (4), 618-632, 2007
1682007
An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading
F Carrabs, R Cerulli, JF Cordeau
INFOR: Information Systems and Operational Research 45 (4), 223-238, 2007
772007
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
672017
The set orienteering problem
C Archetti, F Carrabs, R Cerulli
European Journal of Operational Research 267 (1), 264-272, 2018
482018
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
F Carrabs, R Cerulli, MG Speranza
Networks 61 (1), 58-75, 2013
482013
Maximizing lifetime in wireless sensor networks with multiple sensor families
F Carrabs, R Cerulli, M Gentili, A Raiconi
Computers & operations research 60, 121-137, 2015
452015
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints
F Carrabs, R Cerulli, A Raiconi
Journal of Network and Computer Applications 58, 12-22, 2015
422015
Lower and upper bounds for the spanning tree with minimum branch vertices
F Carrabs, R Cerulli, M Gaudioso, M Gentili
Computational Optimization and Applications 56, 405-438, 2013
412013
The labeled maximum matching problem
F Carrabs, R Cerulli, M Gentili
Computers & Operations Research 36 (6), 1859-1871, 2009
392009
Seismic retrofitting of existing RC buildings: a rational selection procedure based on Genetic Algorithms
R Falcone, F Carrabs, R Cerulli, C Lima, E Martinelli
Structures 22, 310-326, 2019
372019
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
F Carrabs, R Cerulli, R Pentangelo, A Raiconi
Annals of Operations Research 298 (1-2), 65-78, 2021
302021
An exact approach for the grocery delivery problem in urban areas
F Carrabs, R Cerulli, A Sciomachen
Soft Computing 21, 2439-2450, 2017
212017
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
192020
A biased random-key genetic algorithm for the set orienteering problem
F Carrabs
European Journal of Operational Research 292 (3), 830-854, 2021
182021
The rainbow spanning forest problem
F Carrabs, C Cerrone, R Cerulli, S Silvestri
Soft Computing 22, 2765-2776, 2018
182018
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints
F Carrabs, R Cerulli, C D’Ambrosio, A Raiconi
RAIRO-Operations Research 51 (3), 607-625, 2017
182017
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
Extending lifetime through partial coverage and roles allocation in connectivity-constrained sensor networks
F Carrabs, R Cerulli, C D’Ambrosio, A Raiconi
IFAC-PapersOnLine 49 (12), 973-978, 2016
182016
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
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem
F Carrabs, C Cerrone, R Pentangelo
Networks 74 (2), 134-147, 2019
172019
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20