Carrabs Francesco
Título
Citado por
Citado por
Año
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
1382007
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
682007
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
422017
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
382015
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
362013
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 (2), 405-438, 2013
342013
The labeled maximum matching problem
F Carrabs, R Cerulli, M Gentili
Computers & Operations Research 36 (6), 1859-1871, 2009
342009
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
322015
The set orienteering problem
C Archetti, F Carrabs, R Cerulli
European Journal of Operational Research 267 (1), 264-272, 2018
192018
A linear time algorithm for the minimum weighted feedback vertex set on diamonds
F Carrabs, R Cerulli, M Gentili, G Parlato
Information Processing Letters 94 (1), 29-35, 2005
162005
A linear time algorithm for the minimum weighted feedback vertex set on diamonds
F Carrabs, R Cerulli, M Gentili, G Parlato
Information Processing Letters 94 (1), 29-35, 2005
162005
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints
F Carrabs, R Cerulli, C D’Ambrosio, A Raiconi
Optimization Letters 11 (7), 1341-1356, 2017
152017
An exact approach for the grocery delivery problem in urban areas
F Carrabs, R Cerulli, A Sciomachen
Soft Computing 21 (9), 2439-2450, 2017
142017
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
142016
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
F Carrabs, R Cerulli, R Pentangelo, A Raiconi
Annals of Operations Research, 1-14, 2018
122018
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
122014
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
112017
A memetic algorithm for the weighted feedback vertex set problem
F Carrabs, C Cerrone, R Cerulli
Networks 64 (4), 339-356, 2014
112014
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem
F Carrabs, C Cerrone, R Pentangelo
Networks 74 (2), 134-147, 2019
102019
A mathematical programming approach for the maximum labeled clique problem
F Carrabs, R Cerulli, P Dell’Olmo
Procedia-Social and Behavioral Sciences 108, 69-78, 2014
102014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20