Tobia Calogiuri

According to our database, Tobia Calogiuri authored at least 7 papers between 2015 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

The multi-period p-center problem with time-dependent travel times.

Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero, Emanuele Manni

Comput. Oper. Res., 2021

2020

HINT project: a BPM teleconsultation and telemonitoring platform.

Antonio Caforio, Tobia Calogiuri, Mariangela Lazoi, Gianvito Mitrano, Roberto Paiano

Proceedings of the ICIST '20: 10th International Conference on Information Systems and Technologies, 2020

2019

An exact bidirectional A⋆ approach for solving resource-constrained shortest path problems.

Barrett W. Thomas, Tobia Calogiuri, Mike Hewitt

Networks, 2019

A branch-and-bound algorithm for the time-Dependent rural postman problem.

Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero, Renata Mansini

Comput. Oper. Res., 2019

2018

A branch-and-bound algorithm for the time-dependent travelling salesman problem.

Anna Arigliano, Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero

Networks, 2018

2016

Neighborhood Synthesis from an Ensemble of MIP and CP Models.

Tommaso Adamo, Tobia Calogiuri, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero, Emanuele Manni

Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016

2015

The time-dependent quickest path problem: Properties and bounds.

Tobia Calogiuri, Gianpaolo Ghiani, Emanuela Guerriero

Networks, 2015