default search action
Tommaso Adamo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Tommaso Adamo
, Lucio Colizzi
Crop planting layout optimization in sustainable agriculture: A constraint programming approach. Comput. Electron. Agric. 224: 109162 (2024) - [j13]Tommaso Adamo
Real-time schedule adjustments for conflict-free vehicle routing. Comput. Oper. Res. 166: 106625 (2024) - [j12]Tommaso Adamo
A review of recent advances in time-dependent vehicle routing. Eur. J. Oper. Res. 319(1): 1-15 (2024) - [j11]Tommaso Adamo
A multi-modal tourist trip planner integrating road and pedestrian networks. Expert Syst. Appl. 237(Part B): 121457 (2024) - 2023
- [j10]Tommaso Adamo
Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem. IEEE Access 11: 2001-2011 (2023) - [j9]Tommaso Adamo
A Surprisal-Based Greedy Heuristic for the Set Covering Problem. Algorithms 16(7): 321 (2023) - [j8]Tommaso Adamo
Recovering feasibility in real-time conflict-free vehicle routing. Comput. Ind. Eng. 183: 109437 (2023) - 2021
- [j7]Tommaso Adamo
On path ranking in time-dependent graphs. Comput. Oper. Res. 135: 105446 (2021) - [c2]Tommaso Adamo
Properties and Bounds for the Single-vehicle Capacitated Routing Problem with Time-dependent Travel Times and Multiple Trips. ICORES 2021: 82-87 - [i2]Tommaso Adamo
Learned upper bounds for the Time-Dependent Travelling Salesman Problem. CoRR abs/2107.13641 (2021) - 2020
- [j6]Gianpaolo Ghiani, Tommaso Adamo
Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning. Algorithms 13(12): 340 (2020) - [j5]Tommaso Adamo
An enhanced lower bound for the Time-Dependent Travelling Salesman Problem. Comput. Oper. Res. 113 (2020) - [j4]Tommaso Adamo
A learn-and-construct framework for general mixed-integer programming problems. Int. Trans. Oper. Res. 27(1): 9-25 (2020) - [j3]Tommaso Adamo
Ejection chain moves for automatic neighborhood synthesis in constrained cardinality-minimization problems. Int. Trans. Oper. Res. 27(2): 1210-1235 (2020) - [i1]Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero:
On path ranking in time-dependent graphs. CoRR abs/2009.07588 (2020)
2010 – 2019
- 2018
- [j2]Tommaso Adamo
Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows. Transp. Sci. 52(4): 739-755 (2018) - 2017
- [j1]Tommaso Adamo
MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration. Comput. Oper. Res. 83: 106-119 (2017) - 2016
- [c1]Tommaso Adamo
Neighborhood Synthesis from an Ensemble of MIP and CP Models. LION 2016: 221-226
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-10 01:17 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: