default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTommaso Pastore
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Daniele Ferone
, Paola Festa, Serena Fugaro, Tommaso Pastore:
Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens. Int. Trans. Oper. Res. 32(1): 90-116 (2025)- 2023
- [j7]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) - [j6]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) - 2021
- [j5]Giulio Mariniello, Tommaso Pastore, Costantino Menna, Paola Festa, Domenico Asprone:
Structural damage detection and localization using decision tree ensemble and vibration data. Comput. Aided Civ. Infrastructure Eng. 36(9): 1129-1149 (2021) - [j4]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) - [j3]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
- [j2]Tommaso Pastore, Anna Martínez-Gavara, Antonio Napoletano, Paola Festa, Rafael Martí:
Tabu search for min-max edge crossing in graphs. Comput. Oper. Res. 114 (2020) - [c4]Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore:
On the Shortest Path Problems with Edge Constraints. ICTON 2020: 1-4
2010 – 2019
- 2019
- [j1]Antonio Napoletano, Anna Martínez-Gavara, Paola Festa, Tommaso Pastore, Rafael Martí:
Heuristics for the Constrained Incremental Graph Drawing Problem. Eur. J. Oper. Res. 274(2): 710-729 (2019) - 2018
- [b1]Tommaso Pastore:
Logic learning and optimized drawing: two hard combinatorial problems. University of Naples Federico II, Italy, 2018 - [c3]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 - 2017
- [c2]Giovanni Felici, Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore:
A GRASP for the Minimum Cost SAT Problem. LION 2017: 64-78 - 2016
- [c1]Daniele Ferone, Paola Festa, Antonio Napoletano, Tommaso Pastore:
Reoptimizing shortest paths: From state of the art to new recent perspectives. ICTON 2016: 1-5 - [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)
Coauthor Index
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-09-21 23:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
