| 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 | 183 | 2007 |
| 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 | 77 | 2007 |
| 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 | 73 | 2017 |
| The set orienteering problem C Archetti, F Carrabs, R Cerulli European Journal of Operational Research 267 (1), 264-272, 2018 | 63 | 2018 |
| 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 | 49 | 2013 |
| 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 | 48 | 2019 |
| 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 | 47 | 2015 |
| 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 | 45 | 2015 |
| 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 | 43 | 2013 |
| 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), 65-78, 2021 | 42 | 2021 |
| The labeled maximum matching problem F Carrabs, R Cerulli, M Gentili Computers & Operations Research 36 (6), 1859-1871, 2009 | 39 | 2009 |
| A biased random-key genetic algorithm for the set orienteering problem F Carrabs European Journal of Operational Research 292 (3), 830-854, 2021 | 30 | 2021 |
| Artificial neural network for technical feasibility prediction of seismic retrofitting in existing RC structures R Falcone, A Ciaramella, F Carrabs, N Strisciuglio, E Martinelli Structures 41, 1220-1234, 2022 | 23 | 2022 |
| A multiethnic genetic approach for the minimum conflict weighted spanning tree problem F Carrabs, C Cerrone, R Pentangelo Networks 74 (2), 134-147, 2019 | 23 | 2019 |
| 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 | 22 | 2020 |
| An exact approach for the grocery delivery problem in urban areas F Carrabs, R Cerulli, A Sciomachen Soft Computing 21, 2439-2450, 2017 | 22 | 2017 |
| A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs F Carrabs, M Gaudioso Networks 78 (1), 32-45, 2021 | 21 | 2021 |
| 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 | 21 | 2014 |
| 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 | 20 | 2017 |
| 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-Recherche Opérationnelle 51 (3), 607-625, 2017 | 19 | 2017 |
Raffaele CERULLIUniversity of SalernoE-mailová adresa ověřena na: unisa.it