CARRABS, Francesco
CARRABS, Francesco
Dipartimento di Matematica/DIPMAT
A biased random-key genetic algorithm for the set orienteering problem
2021 Carrabs, F.
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
2013 Carrabs, Francesco; Cerulli, Raffaele; Maria Grazia, Speranza
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows
2006 Carrabs, Francesco; Cerulli, Raffaele; Gentili, Monica
A genetic approach for the 2-edge-connected minimum branch vertices problem
2023 Carrabs, F.; Cerulli, R.; Laureana, F.; Serra, D.; Sorgente, C.
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints
2015 Carrabs, Francesco; Cerulli, Raffaele; D'Ambrosio, Ciriaco; Raiconi, Andrea
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
2021 Carrabs, F.; Gaudioso, M.
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds
2005 Carrabs, Francesco; Cerulli, Raffaele; Gentili, Monica; Parlato, G.
A Mathematical Programming Approach for the Maximum Labeled Clique Problem
2014 Carrabs, Francesco; Cerulli, Raffaele; P., Dell’Olmo
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem
2014 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem
2019 Carrabs, Francesco; Cerrone, Carmine; Pentangelo, Rosa
A new formulation and a branch-and-cut algorithm for the set orienteering problem
2024 Archetti, C.; Carrabs, F.; Cerulli, R.; Laureana, F.
A novel discretization scheme for the close enough traveling salesman problem
2017 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele; Gaudioso, Manlio
A reduction heuristic for the all-colors shortest path problem
2021 Carrabs, Francesco; Cerulli, Raffaele; Raiconi, Andrea
A Tabu Search Approach for the Circle Packing Problem
2014 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
2011 Carrabs, Francesco; Cerulli, Raffaele; Gentili, Monica; Gennaro, Parlato
A two-level metaheuristic for the all colors shortest path problem
2018 Carrabs, F.; Cerulli, R.; Pentangelo, R.; Raiconi, A.
A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem
2024 Carrabs, F.; Gaudioso, M.; Miglionico, G.
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
2020 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele; Golden, Bruce
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
2007 Carrabs, Francesco; Cerulli, Raffaele; J. F., Cordeau
An evolutionary approach for the offsetting inventory cycle problem
2017 Franciosi, Chiara; Carrabs, Francesco; Cerulli, Raffaele; Miranda, Salvatore