![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Daniele Ferone
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]Daniele Ferone, Paola Festa, Tommaso Pastore, Mauricio G. C. Resende:
Efficient GRASP solution approach for the Prisoner Transportation Problem. Comput. Oper. Res. 153: 106161 (2023) - [j19]Daniele Ferone, Paola Festa, Serena Fugaro
, Tommaso Pastore:
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm. Networks 81(2): 204-219 (2023) - [j18]Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa
, Francesca Guerriero, Giusy Macrina:
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping. Optim. Lett. 17(9): 1981-2003 (2023) - 2022
- [j17]Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero
:
A generalized shortest path tour problem with time windows. Comput. Optim. Appl. 83(2): 593-614 (2022) - [j16]Daniele Ferone
, Paola Festa, Francesca Guerriero
:
The Rainbow Steiner Tree Problem. Comput. Oper. Res. 139: 105621 (2022) - [j15]Maurizio Bruglieri
, Daniele Ferone
, Paola Festa
, Ornella Pisacane
:
A GRASP with penalty objective function for the Green Vehicle Routing Problem with Private Capacitated Stations. Comput. Oper. Res. 143: 105770 (2022) - [j14]Stephanie Alvarez Fernandez
, Daniele Ferone
, Angel A. Juan
, Daniele Tarchi
:
A simheuristic algorithm for video streaming flows optimisation with QoS threshold modelled as a stochastic single-allocation p-hub median problem. J. Simulation 16(5): 480-493 (2022) - [j13]Luigi Di Puglia Pugliese
, Daniele Ferone
, Paola Festa
, Francesca Guerriero
, Giusy Macrina
:
Solution approaches for the vehicle routing problem with occasional drivers and time windows. Optim. Methods Softw. 37(4): 1384-1414 (2022) - 2021
- [j12]Mirko Alicastro, Daniele Ferone, Paola Festa, Serena Fugaro
, Tommaso Pastore
:
A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems. Comput. Oper. Res. 131: 105272 (2021) - [j11]Juan Ignacio Latorre Biel
, Daniele Ferone, Angel A. Juan
, Javier Faulin:
Combining simheuristics with Petri nets for solving the stochastic vehicle routing problem with correlated demands. Expert Syst. Appl. 168: 114240 (2021) - [j10]Francesco Carrabs
, Ciriaco D'Ambrosio
, Daniele Ferone, Paola Festa, Federica Laureana:
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions. Networks 78(1): 17-31 (2021) - [j9]Daniele Ferone, Paola Festa, Serena Fugaro
, Tommaso Pastore
:
A dynamic programming algorithm for solving the k-Color Shortest Path Problem. Optim. Lett. 15(6): 1973-1992 (2021) - 2020
- [j8]Luigi Di Puglia Pugliese
, Daniele Ferone
, Paola Festa
, Francesca Guerriero
:
Shortest path tour problem with time windows. Eur. J. Oper. Res. 282(1): 334-344 (2020) - [j7]Daniele Ferone
, Sara Hatami, Eliana María González-Neira
, Angel A. Juan
, Paola Festa:
A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem. Int. Trans. Oper. Res. 27(3): 1368-1391 (2020) - [j6]Daniele Ferone
, Paola Festa, Francesca Guerriero:
An efficient exact approach for the constrained shortest path tour problem. Optim. Methods Softw. 35(1): 1-20 (2020) - [c9]Daniele Ferone, Paola Festa, Serena Fugaro
, Tommaso Pastore
:
On the Shortest Path Problems with Edge Constraints. ICTON 2020: 1-4
2010 – 2019
- 2019
- [j5]Daniele Ferone, Aljoscha Gruler, Paola Festa, Angel A. Juan
:
Enhancing and extending the classical GRASP framework with biased randomisation and simulation. J. Oper. Res. Soc. 70(8): 1362-1375 (2019) - 2018
- [j4]Stephanie Alvarez Fernandez
, Daniele Ferone, Angel A. Juan
, Daniel G. Silva
, Jésica de Armas:
A 2-stage biased-randomized iterated local search for the uncapacitated single allocation p-hub median problem. Trans. Emerg. Telecommun. Technol. 29(9) (2018) - [c8]Paola Festa, Tommaso Pastore
, Daniele Ferone, Angel A. Juan
, Christopher Bayliss
:
Integrating biased-Randomized grasp with Monte Carlo simulation for solving the Vehicle Routing Problem with stochastic demands. WSC 2018: 2989-3000 - [c7]Ludovica Maccarrone, Tommaso Giovannelli
, Daniele Ferone, Javier Panadero
, Angel A. Juan
:
A simheuristic Algorithm for solving an Integrated Resource Allocation and Scheduling Problem. WSC 2018: 3340-3351 - 2017
- [j3]Eliana María González-Neira
, Daniele Ferone
, Sara Hatami, Angel A. Juan
:
A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times. Simul. Model. Pract. Theory 79: 23-36 (2017) - [c6]Daniele Ferone
, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende:
On the fast solution of the p-center problem. ICTON 2017: 1-4 - [c5]Giovanni Felici, Daniele Ferone
, Paola Festa, Antonio Napoletano, Tommaso Pastore
:
A GRASP for the Minimum Cost SAT Problem. LION 2017: 64-78 - [c4]Daniele Ferone
, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende:
A New Local Search for the p-Center Problem Based on the Critical Vertex Concept. LION 2017: 79-92 - 2016
- [j2]Daniele Ferone
, Paola Festa, Francesca Guerriero
, Demetrio Laganà
:
The constrained shortest path tour problem. Comput. Oper. Res. 74: 64-77 (2016) - [j1]Daniele Ferone
, Paola Festa, Mauricio G. C. Resende:
Hybridizations of GRASP with path relinking for the far from most string problem. Int. Trans. Oper. Res. 23(3): 481-506 (2016) - [c3]Daniele Ferone
, Paola Festa, Antonio Napoletano, Tommaso Pastore
:
Reoptimizing shortest paths: From state of the art to new recent perspectives. ICTON 2016: 1-5 - [c2]Daniele Ferone
, Paola Festa, Aljoscha Gruler, Angel A. Juan
:
Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times. WSC 2016: 2205-2215 - [i2]Daniele Ferone, Angelo M. Facchiano, Anna Marabotti, Paola Festa:
A new GRASP metaheuristic for biclustering of gene expression data. PeerJ Prepr. 4: e1679 (2016) - [i1]Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore:
The solution of large-scale Minimum Cost SAT Problem as a tool for data analysis in bioinformatics. PeerJ Prepr. 4: e2635 (2016) - 2013
- [c1]Daniele Ferone
, Paola Festa, Mauricio G. C. Resende:
Hybrid Metaheuristics for the Far From Most String Problem. Hybrid Metaheuristics 2013: 174-188
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint