CERULLI, Raffaele

CERULLI, Raffaele  

Dipartimento di Matematica/DIPMAT  

Mostra records
Risultati 1 - 20 di 87 (tempo di esecuzione: 0.029 secondi).
Titolo Data di pubblicazione Autore(i) File
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem 1-gen-2017 Silvestri, Selene; Laporte, Gilbert; Cerulli, Raffaele
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 Dual Ascent Approach to the Bounded-Degree Spanning Tree Problem 1-gen-2007 Gentili, Monica; Cerulli, Raffaele; Manlio, Gaudioso
A Flow Formulation for the Close-Enough Arc Routing Problem 1-gen-2017 Cerrone, Carmine; Cerulli, Raffaele; Golden, Bruce; Pentangelo, Rosa
A genetic approach for the 2-edge-connected minimum branch vertices problem 1-gen-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 1-gen-2015 Carrabs, Francesco; Cerulli, Raffaele; D'Ambrosio, Ciriaco; Raiconi, Andrea
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 multiplier adjustment technique for the concentrator location problem 1-gen-1998 Cerulli, Raffaele; Gaudioso, M; Sergeyev, Y. A. D.
A new formulation and a branch-and-cut algorithm for the set orienteering problem 1-gen-2024 Archetti, C.; Carrabs, F.; Cerulli, R.; Laureana, F.
A new forward backward Auction algorithm 1-gen-1999 Cerulli, Raffaele; P., Festa; Raiconi, Giancarlo
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