CARRABS, Francesco

CARRABS, Francesco  

Dipartimento di Matematica/DIPMAT  

Mostra records
Risultati 1 - 20 di 46 (tempo di esecuzione: 0.02 secondi).
Titolo Data di pubblicazione Autore(i) File
A biased random-key genetic algorithm for the set orienteering problem 1-gen-2021 Carrabs, F.
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks 1-gen-2013 Carrabs, Francesco; Cerulli, Raffaele; Maria Grazia, Speranza
A cluster-lightening route reduction strategy for the vehicle routing problem with time windows 1-gen-2006 Carrabs, Francesco; Cerulli, Raffaele; Gentili, Monica
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints 1-gen-2015 Carrabs, Francesco; Cerulli, Raffaele; D'Ambrosio, Ciriaco; Raiconi, Andrea
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs 1-gen-2021 Carrabs, F.; Gaudioso, M.
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds 1-gen-2005 Carrabs, Francesco; Cerulli, Raffaele; Gentili, Monica; Parlato, G.
A Mathematical Programming Approach for the Maximum Labeled Clique Problem 1-gen-2014 Carrabs, Francesco; Cerulli, Raffaele; P., Dell’Olmo
A Memetic Algorithm for the Weighted Feedback Vertex Set Problem 1-gen-2014 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem 1-gen-2019 Carrabs, Francesco; Cerrone, Carmine; Pentangelo, Rosa
A novel discretization scheme for the close enough traveling salesman problem 1-gen-2017 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele; Gaudioso, Manlio
A reduction heuristic for the all-colors shortest path problem 1-gen-2021 Carrabs, Francesco; Cerulli, Raffaele; Raiconi, Andrea
A Tabu Search Approach for the Circle Packing Problem 1-gen-2014 Carrabs, Francesco; Cerrone, Carmine; Cerulli, Raffaele
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem 1-gen-2011 Carrabs, Francesco; Cerulli, Raffaele; Gentili, Monica; Gennaro, Parlato
A two-level metaheuristic for the all colors shortest path problem 1-gen-2018 Carrabs, F.; Cerulli, R.; Pentangelo, R.; Raiconi, A.
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem 1-gen-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 1-gen-2007 Carrabs, Francesco; Cerulli, Raffaele; J. F., Cordeau
An evolutionary approach for the offsetting inventory cycle problem 1-gen-2017 Franciosi, Chiara; Carrabs, Francesco; Cerulli, Raffaele; Miranda, Salvatore
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints 1-gen-2017 Carrabs, Francesco; Cerulli, Raffaele; D'Ambrosio, Ciriaco; Raiconi, Andrea
An exact approach for the grocery delivery problem in urban areas 1-gen-2017 Carrabs, Francesco; Cerulli, Raffaele; Sciomachen, A.
An improved heuristic approach for the interval immune transportation problem 1-gen-2021 Carrabs, Francesco; Cerulli, Raffaele; D'Ambrosio, Ciriaco; Della Croce, Federico; Gentili, Monica