Tommaso Adamo

Orcid: 0000-0002-9505-5869

According to our database1, Tommaso Adamo authored at least 13 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A multi-modal tourist trip planner integrating road and pedestrian networks.
Expert Syst. Appl., March, 2024

2023
Recovering feasibility in real-time conflict-free vehicle routing.
Comput. Ind. Eng., September, 2023

A Surprisal-Based Greedy Heuristic for the Set Covering Problem.
Algorithms, July, 2023

Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem.
IEEE Access, 2023

2021
On path ranking in time-dependent graphs.
Comput. Oper. Res., 2021

Properties and Bounds for the Single-vehicle Capacitated Routing Problem with Time-dependent Travel Times and Multiple Trips.
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

2020
Ejection chain moves for automatic neighborhood synthesis in constrained cardinality-minimization problems.
Int. Trans. Oper. Res., 2020

A learn-and-construct framework for general mixed-integer programming problems.
Int. Trans. Oper. Res., 2020

An enhanced lower bound for the Time-Dependent Travelling Salesman Problem.
Comput. Oper. Res., 2020

Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning.
Algorithms, 2020

2018
Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows.
Transp. Sci., 2018

2017
MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration.
Comput. Oper. Res., 2017

2016
Neighborhood Synthesis from an Ensemble of MIP and CP Models.
Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016


  Loading...