Hybrid Metaheuristics for the Far From Most String Problem. - Daniele Ferone; Paola Festa; Mauricio G. C. Resende (Hybrid Metaheuristics, 2013)

Reoptimizing shortest paths: From state of the art to new recent perspectives. - Daniele Ferone; Paola Festa; Antonio Napoletano; Tommaso Pastore (ICTON, 2016)

Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times. - Daniele Ferone; Paola Festa; Aljoscha Gruler; Angel A. Juan (WSC, 2016)

The constrained shortest path tour problem. - Daniele Ferone; Paola Festa; Francesca Guerriero; Demetrio Laganà (Comput. Oper. Res., 2016)

Hybridizations of GRASP with path relinking for the far from most string problem. - Daniele Ferone; Paola Festa; Mauricio G. C. Resende (Int. Trans. Oper. Res., 2016)

The solution of large-scale Minimum Cost SAT Problem as a tool for data analysis in bioinformatics. - Giovanni Felici; Daniele Ferone; Paola Festa; Antonio Napoletano; Tommaso Pastore (PeerJ Prepr., 2016)

A new GRASP metaheuristic for biclustering of gene expression data. - Daniele Ferone; Angelo M. Facchiano; Anna Marabotti; Paola Festa (PeerJ Prepr., 2016)

On the fast solution of the p-center problem. - Daniele Ferone; Paola Festa; Antonio Napoletano; Mauricio G. C. Resende (ICTON, 2017)

A GRASP for the Minimum Cost SAT Problem. - Giovanni Felici; Daniele Ferone; Paola Festa; Antonio Napoletano; Tommaso Pastore (LION, 2017)

A New Local Search for the p-Center Problem Based on the Critical Vertex Concept. - Daniele Ferone; Paola Festa; Antonio Napoletano; Mauricio G. C. Resende (LION, 2017)

A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times. - Eliana María González-Neira; Daniele Ferone; Sara Hatami; Angel A. Juan (Simul. Model. Pract. Theory, 2017)

The Shortest Path Tour Problem and its variants. - Daniele Ferone (2017)

Integrating biased-Randomized grasp with Monte Carlo simulation for solving the Vehicle Routing Problem with stochastic demands. - Paola Festa; Tommaso Pastore; Daniele Ferone; Angel A. Juan; Christopher Bayliss (WSC, 2018)

A simheuristic Algorithm for solving an Integrated Resource Allocation and Scheduling Problem. - Ludovica Maccarrone; Tommaso Giovannelli; Daniele Ferone; Javier Panadero; Angel A. Juan (WSC, 2018)

A 2-stage biased-randomized iterated local search for the uncapacitated single allocation p-hub median problem. - Stephanie Alvarez Fernandez; Daniele Ferone; Angel A. Juan; Daniel G. Silva; Jésica de Armas (Trans. Emerg. Telecommun. Technol., 2018)

Enhancing and extending the classical GRASP framework with biased randomisation and simulation. - Daniele Ferone; Aljoscha Gruler; Paola Festa; Angel A. Juan (J. Oper. Res. Soc., 2019)

On the Shortest Path Problems with Edge Constraints. - Daniele Ferone; Paola Festa; Serena Fugaro; Tommaso Pastore (ICTON, 2020)

Shortest path tour problem with time windows. - Luigi Di Puglia Pugliese; Daniele Ferone; Paola Festa; Francesca Guerriero (Eur. J. Oper. Res., 2020)

A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem. - Daniele Ferone; Sara Hatami; Eliana María González-Neira; Angel A. Juan; Paola Festa (Int. Trans. Oper. Res., 2020)

An efficient exact approach for the constrained shortest path tour problem. - Daniele Ferone; Paola Festa; Francesca Guerriero (Optim. Methods Softw., 2020)

A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems. - Mirko Alicastro; Daniele Ferone; Paola Festa; Serena Fugaro; Tommaso Pastore (Comput. Oper. Res., 2021)

Combining simheuristics with Petri nets for solving the stochastic vehicle routing problem with correlated demands. - Juan Ignacio Latorre Biel; Daniele Ferone; Angel A. Juan; Javier Faulin (Expert Syst. Appl., 2021)

The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions. - Francesco Carrabs; Ciriaco D'Ambrosio; Daniele Ferone; Paola Festa; Federica Laureana (Networks, 2021)

A dynamic programming algorithm for solving the k-Color Shortest Path Problem. - Daniele Ferone; Paola Festa; Serena Fugaro; Tommaso Pastore (Optim. Lett., 2021)

A generalized shortest path tour problem with time windows. - Luigi Di Puglia Pugliese; Daniele Ferone; Paola Festa; Francesca Guerriero (Comput. Optim. Appl., 2022)

A GRASP with penalty objective function for the Green Vehicle Routing Problem with Private Capacitated Stations. - Maurizio Bruglieri; Daniele Ferone; Paola Festa; Ornella Pisacane (Comput. Oper. Res., 2022)

The Rainbow Steiner Tree Problem. - Daniele Ferone; Paola Festa; Francesca Guerriero (Comput. Oper. Res., 2022)

A simheuristic algorithm for video streaming flows optimisation with QoS threshold modelled as a stochastic single-allocation p-hub median problem. - Stephanie Alvarez Fernandez; Daniele Ferone; Angel A. Juan; Daniele Tarchi (J. Simulation, 2022)

Solution approaches for the vehicle routing problem with occasional drivers and time windows. - Luigi Di Puglia Pugliese; Daniele Ferone; Paola Festa; Francesca Guerriero; Giusy Macrina (Optim. Methods Softw., 2022)

The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm. - Daniele Ferone; Paola Festa; Serena Fugaro; Tommaso Pastore (Networks, 2023)

Efficient GRASP solution approach for the Prisoner Transportation Problem. - Daniele Ferone; Paola Festa; Tommaso Pastore; Mauricio G. C. Resende (Comput. Oper. Res., 2023)

Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping. - Luigi Di Puglia Pugliese; Daniele Ferone; Paola Festa; Francesca Guerriero; Giusy Macrina (Optim. Lett., 2023)

Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens. - Daniele Ferone; Paola Festa; Serena Fugaro; Tommaso Pastore (Int. Trans. Oper. Res., 2025)