Daniele Ferone
TitleCited byYear
A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times
EM Gonzalez-Neira, D Ferone, S Hatami, AA Juan
Simulation Modelling Practice and Theory 79, 23-36, 2017
272017
The constrained shortest path tour problem
D Ferone, P Festa, F Guerriero, D Laganą
Computers & Operations Research 74, 64-77, 2016
142016
Hybridizations of GRASP with path relinking for the far from most string problem
D Ferone, P Festa, MGC Resende
International Transactions in Operational Research 23 (3), 481-506, 2016
112016
Hybrid metaheuristics for the far from most string problem
D Ferone, P Festa, MGC Resende
International Workshop on Hybrid Metaheuristics, 174-188, 2013
112013
Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times
D Ferone, P Festa, A Gruler, AA Juan
2016 Winter Simulation Conference (WSC), 2205-2215, 2016
92016
A 2‐stage biased‐randomized iterated local search for the uncapacitated single allocation p‐hub median problem
S Alvarez Fernandez, D Ferone, AA Juan, DG Silva, J de Armas
Transactions on Emerging Telecommunications Technologies 29 (9), e3418, 2018
62018
A new local search for the p-center problem based on the critical vertex concept
D Ferone, P Festa, A Napoletano, MGC Resende
International Conference on Learning and Intelligent Optimization, 79-92, 2017
62017
Consolidation centers in city logistics: A cooperative approach based on the location routing problem
S Nataraj, D Ferone, C Quintero-Araujo, A Juan, P Festa
International Journal of Industrial Engineering Computations 10 (3), 393-404, 2019
52019
Enhancing and extending the classical GRASP framework with biased randomisation and simulation
D Ferone, A Gruler, P Festa, AA Juan
Journal of the Operational Research Society 70 (8), 1362-1375, 2019
42019
Shortest Paths on Dynamic Graphs: A Survey
D Ferone, P Festa, A Napoletano, T Pastore
Pesquisa Operacional 37 (3), 487-508, 2017
32017
Reoptimizing shortest paths: From state of the art to new recent perspectives
D Ferone, P Festa, A Napoletano, T Pastore
2016 18th International Conference on Transparent Optical Networks (ICTON), 1-5, 2016
32016
An efficient exact approach for the constrained shortest path tour problem
D Ferone, P Festa, F Guerriero
Optimization Methods and Software, 1-20, 2019
22019
A GRASP for the Minimum Cost SAT Problem
G Felici, D Ferone, P Festa, A Napoletano, T Pastore
International Conference on Learning and Intelligent Optimization, 64-78, 2017
22017
A new GRASP metaheuristic for biclustering of gene expression data
D Ferone, A Facchiano, A Marabotti, P Festa
PeerJ PrePrints, 2016
22016
Integrating biased-randomized GRASP with Monte Carlo simulation for solving the vehicle routing problem with stochastic demands
P Festa, T Pastore, D Ferone, AA Juan, C Bayliss
2018 Winter Simulation Conference (WSC), 2989-3000, 2018
12018
On the fast solution of the p-center problem
D Ferone, P Festa, A Napoletano, MGC Resende
2017 19th International Conference on Transparent Optical Networks (ICTON), 1-4, 2017
12017
On the Far from Most String Problem, One of the Hardest String Selection Problems
D Ferone, P Festa, MGC Resende
Dynamics of Information Systems, 129-148, 2014
12014
A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
D Ferone, S Hatami, EM Gonzįlez‐Neira, AA Juan, P Festa
International Transactions in Operational Research, 2019
2019
Shortest path tour problem with time windows
LDP Pugliese, D Ferone, P Festa, F Guerriero
European Journal of Operational Research, 2019
2019
Shortest Path Tour Problem with Time Windows
L Puglia Pugliese, D Ferone, P Festa, F Guerriero
2019
The system can't perform the operation now. Try again later.
Articles 1–20