The time-dependent quickest path problem: Properties and bounds. - Tobia Calogiuri; Gianpaolo Ghiani; Emanuela Guerriero (Networks, 2015)

Neighborhood Synthesis from an Ensemble of MIP and CP Models. - Tommaso Adamo; Tobia Calogiuri; Gianpaolo Ghiani; Antonio Grieco; Emanuela Guerriero; Emanuele Manni (LION, 2016)

A branch-and-bound algorithm for the time-dependent travelling salesman problem. - Anna Arigliano; Tobia Calogiuri; Gianpaolo Ghiani; Emanuela Guerriero (Networks, 2018)

A branch-and-bound algorithm for the time-Dependent rural postman problem. - Tobia Calogiuri; Gianpaolo Ghiani; Emanuela Guerriero; Renata Mansini (Comput. Oper. Res., 2019)

An exact bidirectional A⋆ approach for solving resource-constrained shortest path problems. - Barrett W. Thomas; Tobia Calogiuri; Mike Hewitt (Networks, 2019)

HINT project: a BPM teleconsultation and telemonitoring platform. - Antonio Caforio; Tobia Calogiuri; Mariangela Lazoi; Gianvito Mitrano; Roberto Paiano (ICIST, 2020)

The multi-period p-center problem with time-dependent travel times. - Tobia Calogiuri; Gianpaolo Ghiani; Emanuela Guerriero; Emanuele Manni (Comput. Oper. Res., 2021)