Francesco Carrabs

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 29

Top Topics

Set Covering Problem

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Publications

Claudia Archetti, Francesco Carrabs, Raffaele Cerulli, Federica Laureana
Corrigendum to "A New Formulation and a Branch-and-Cut Algorithm for the Set Orienteering Problem" [European Journal of Operational Research, Volume 314, Issue 2, 16 April 2024, Pages 446-465]. Eur. J. Oper. Res. 316 (2) (2024)
Francesco Carrabs, Raffaele Cerulli, Renata Mansini, Lorenzo Moreschini, Domenico Serra
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP. Comput. Oper. Res. 166 (2024)
Claudia Archetti, Francesco Carrabs, Raffaele Cerulli, Federica Laureana
A new formulation and a branch-and-cut algorithm for the set orienteering problem. Eur. J. Oper. Res. 314 (2) (2024)
Francesco Carrabs, Manlio Gaudioso, Giovanna Miglionico
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem. EURO J. Comput. Optim. 12 (2024)
Francesco Carrabs, Martina Cerulli, Domenico Serra
Kernel Search approach to solve the Minimum Spanning Tree Problem with conflicting edge pairs. CoRR (2024)
Francesco Carrabs, Raffaele Cerulli, Federica Laureana, Domenico Serra, Carmine Sorgente
A genetic approach for the 2-edge-connected minimum branch vertices problem. Networks 82 (4) (2023)
Francesco Carrabs, Manlio Gaudioso
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs. Networks 78 (1) (2021)
Francesco Carrabs, Ciriaco D'Ambrosio, Daniele Ferone, Paola Festa, Federica Laureana
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions. Networks 78 (1) (2021)
Francesco Carrabs, Ciriaco D'Ambrosio, Andrea Raiconi
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network. Optim. Lett. 15 (5) (2021)
Francesco Carrabs, Raffaele Cerulli, Andrea Raiconi
A reduction heuristic for the all-colors shortest path problem. RAIRO Oper. Res. 55 (Supplement) (2021)
Francesco Carrabs
A biased random-key genetic algorithm for the set orienteering problem. Eur. J. Oper. Res. 292 (3) (2021)
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Federica Laureana
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis. J. Optim. Theory Appl. 188 (2) (2021)
Francesco Carrabs, Raffaele Cerulli, Rosa Pentangelo, Andrea Raiconi
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. Ann. Oper. Res. 298 (1) (2021)
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Bruce L. Golden
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem. INFORMS J. Comput. 32 (4) (2020)
Francesco Carrabs, Carmine Cerrone, Rosa Pentangelo
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem. Networks 74 (2) (2019)
Francesco Carrabs, Raffaele Cerulli, Giovanni Felici, Gaurav Singh
Exact approaches for the orderly colored longest path problem: Performance comparison. Comput. Oper. Res. 101 (2019)
Claudia Archetti, Francesco Carrabs, Raffaele Cerulli
The Set Orienteering Problem. Eur. J. Oper. Res. 267 (1) (2018)
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Selene Silvestri
The rainbow spanning forest problem. Soft Comput. 22 (8) (2018)
Francesco Carrabs, Raffaele Cerulli, Rosa Pentangelo, Andrea Raiconi
A two-level metaheuristic for the all colors shortest path problem. Comput. Optim. Appl. 71 (2) (2018)
Francesco Carrabs, Raffaele Cerulli, Monica Gentili
Preface: Theoretical and algorithmic contributions to network optimization problems. Networks 71 (4) (2018)
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Selene Silvestri
On the complexity of rainbow spanning forest problem. Optim. Lett. 12 (3) (2018)
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints. Optim. Lett. 11 (7) (2017)
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Manlio Gaudioso
A novel discretization scheme for the close enough traveling salesman problem. Comput. Oper. Res. 78 (2017)
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi
Prolonging Lifetime in Wireless Sensor Networks with Interference Constraints. GPC (2017)
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints. RAIRO Oper. Res. 51 (3) (2017)
Francesco Carrabs, Raffaele Cerulli, Anna Sciomachen
An exact approach for the grocery delivery problem in urban areas. Soft Comput. 21 (9) (2017)
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Ciriaco D'Ambrosio
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem. GPC (2017)
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Monica Gentili, Andrea Raiconi
Maximizing lifetime in wireless sensor networks with multiple sensor families. Comput. Oper. Res. 60 (2015)
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints. J. Netw. Comput. Appl. 58 (2015)
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli
A memetic algorithm for the weighted feedback vertex set problem. Networks 64 (4) (2014)
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli
A Tabu Search Approach for the Circle Packing Problem. NBiS (2014)
Francesco Carrabs, Raffaele Cerulli, Maria Grazia Speranza
A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61 (1) (2013)
Francesco Carrabs, Raffaele Cerulli, Manlio Gaudioso, Monica Gentili
Lower and upper bounds for the spanning tree with minimum branch vertices. Comput. Optim. Appl. 56 (2) (2013)
Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem. INOC (2011)
Paolo Dell'Olmo, Raffaele Cerulli, Francesco Carrabs
The maximum labeled clique problem. CTW (2011)
Francesco Carrabs, Raffaele Cerulli, Monica Gentili
The labeled maximum matching problem. Comput. Oper. Res. 36 (6) (2009)
Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading. INFORMS J. Comput. 19 (4) (2007)
Francesco Carrabs, Raffaele Cerulli, Jean-François Cordeau
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading. INFOR Inf. Syst. Oper. Res. 45 (4) (2007)
Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds. Inf. Process. Lett. 94 (1) (2005)
Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato
Minimum Weighted Feedback Vertex Set on Diamonds. CTW (2004)
Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato
Minimum Weighted Feedback Vertex Set on Diamonds. Electron. Notes Discret. Math. 17 (2004)