| 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 | 142 | 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 | 70 | 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 | 47 | 2017 |
| 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 | 40 | 2015 |
| 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 | 40 | 2013 |
| The labeled maximum matching problem F Carrabs, R Cerulli, M Gentili Computers & Operations Research 36 (6), 1859-1871, 2009 | 35 | 2009 |
| 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 | 34 | 2013 |
| 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 | 33 | 2015 |
| The set orienteering problem C Archetti, F Carrabs, R Cerulli European Journal of Operational Research 267 (1), 264-272, 2018 | 22 | 2018 |
| 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 | 15 | 2017 |
| 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 | 15 | 2016 |
| 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 | 15 | 2005 |
| 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 | 15 | 2005 |
| An exact approach for the grocery delivery problem in urban areas F Carrabs, R Cerulli, A Sciomachen Soft Computing 21 (9), 2439-2450, 2017 | 14 | 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 51 (3), 607-625, 2017 | 13 | 2017 |
| 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 | 13 | 2014 |
| 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 | 12 | 2021 |
| A memetic algorithm for the weighted feedback vertex set problem F Carrabs, C Cerrone, R Cerulli Networks 64 (4), 339-356, 2014 | 12 | 2014 |
| 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 | 12 | 2014 |
| A multiethnic genetic approach for the minimum conflict weighted spanning tree problem F Carrabs, C Cerrone, R Pentangelo Networks 74 (2), 134-147, 2019 | 11 | 2019 |
Raffaele CERULLIUniversity of SalernoEmail verificata su unisa.it
