Francesco Carrabs

43 papers C 6Journal 36Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints.
Eur. J. Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Renata Mansini, Domenico Serra, Carmine Sorgente
2025 C conf
Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem.
ICORES
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Gabriele Murano
2024 J jnl
A new formulation and a branch-and-cut algorithm for the set orienteering problem.
Eur. J. Oper. Res.
Claudia Archetti, Francesco Carrabs, Raffaele Cerulli, Federica Laureana
2024 J jnl
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem.
EURO J. Comput. Optim.
Francesco Carrabs, Manlio Gaudioso, Giovanna Miglionico
2024 J jnl
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.
Claudia Archetti, Francesco Carrabs, Raffaele Cerulli, Federica Laureana
2024 J jnl
Kernel Search approach to solve the Minimum Spanning Tree Problem with conflicting edge pairs.
CoRR
Francesco Carrabs, Martina Cerulli, Domenico Serra
2024 J jnl
Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP.
Comput. Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Renata Mansini, Lorenzo Moreschini, Domenico Serra
2023 J jnl
A genetic approach for the 2-edge-connected minimum branch vertices problem.
Networks
Francesco Carrabs, Raffaele Cerulli, Federica Laureana, Domenico Serra, Carmine Sorgente
2021 J jnl
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs.
Networks
Francesco Carrabs, Manlio Gaudioso
2021 J jnl
A biased random-key genetic algorithm for the set orienteering problem.
Eur. J. Oper. Res.
Francesco Carrabs
2021 J jnl
A reduction heuristic for the all-colors shortest path problem.
RAIRO Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Andrea Raiconi
2021 J jnl
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach.
Ann. Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Rosa Pentangelo, Andrea Raiconi
2021 J jnl
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network.
Optim. Lett.
Francesco Carrabs, Ciriaco D'Ambrosio, Andrea Raiconi
2021 J jnl
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis.
J. Optim. Theory Appl.
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Federica Laureana
2021 J jnl
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions.
Networks
Francesco Carrabs, Ciriaco D'Ambrosio, Daniele Ferone, Paola Festa, Federica Laureana
2020 J jnl
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem.
INFORMS J. Comput.
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Bruce L. Golden
2019 J jnl
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem.
Networks
Francesco Carrabs, Carmine Cerrone, Rosa Pentangelo
2019 J jnl
Exact approaches for the orderly colored longest path problem: Performance comparison.
Comput. Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Giovanni Felici, Gaurav Singh
2018 J jnl
A two-level metaheuristic for the all colors shortest path problem.
Comput. Optim. Appl.
Francesco Carrabs, Raffaele Cerulli, Rosa Pentangelo, Andrea Raiconi
2018 J jnl
On the complexity of rainbow spanning forest problem.
Optim. Lett.
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Selene Silvestri
2018 J jnl
Preface: Theoretical and algorithmic contributions to network optimization problems.
Networks
Francesco Carrabs, Raffaele Cerulli, Monica Gentili
2018 J jnl
The Set Orienteering Problem.
Eur. J. Oper. Res.
Claudia Archetti, Francesco Carrabs, Raffaele Cerulli
2018 J jnl
The rainbow spanning forest problem.
Soft Comput.
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Selene Silvestri
2017 J jnl
A novel discretization scheme for the close enough traveling salesman problem.
Comput. Oper. Res.
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Manlio Gaudioso
2017 J jnl
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints.
Optim. Lett.
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi
2017 J jnl
An exact approach for the grocery delivery problem in urban areas.
Soft Comput.
Francesco Carrabs, Raffaele Cerulli, Anna Sciomachen
2017 J jnl
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints.
RAIRO Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi
2017 C conf
Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem.
GPC
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Ciriaco D'Ambrosio
2017 C conf
Prolonging Lifetime in Wireless Sensor Networks with Interference Constraints.
GPC
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi
2015 J jnl
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints.
J. Netw. Comput. Appl.
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi
2015 J jnl
Maximizing lifetime in wireless sensor networks with multiple sensor families.
Comput. Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Monica Gentili, Andrea Raiconi
2014 — conf
A Tabu Search Approach for the Circle Packing Problem.
NBiS
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli
2014 J jnl
A memetic algorithm for the weighted feedback vertex set problem.
Networks
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli
2013 J jnl
A branch-and-bound algorithm for the double travelling salesman problem with two stacks.
Networks
Francesco Carrabs, Raffaele Cerulli, Maria Grazia Speranza
2013 J jnl
Lower and upper bounds for the spanning tree with minimum branch vertices.
Comput. Optim. Appl.
Francesco Carrabs, Raffaele Cerulli, Manlio Gaudioso, Monica Gentili
2011 C conf
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem.
INOC
Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato
2011 C conf
The maximum labeled clique problem.
CTW
Paolo Dell'Olmo, Raffaele Cerulli, Francesco Carrabs
2009 J jnl
The labeled maximum matching problem.
Comput. Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Monica Gentili
2007 J jnl
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading.
INFOR Inf. Syst. Oper. Res.
Francesco Carrabs, Raffaele Cerulli, Jean-François Cordeau
2007 J jnl
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading.
INFORMS J. Comput.
Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte
2005 J jnl
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds.
Inf. Process. Lett.
Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato
2004 C conf
Minimum Weighted Feedback Vertex Set on Diamonds.
CTW
Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato
2004 J jnl
Minimum Weighted Feedback Vertex Set on Diamonds.
Electron. Notes Discret. Math.
Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato