| An exact bidirectional A⋆ approach for solving resource‐constrained shortest path problems BW Thomas, T Calogiuri, M Hewitt Networks 73 (2), 187-205, 2019 | 52 | 2019 |
| A branch‐and‐bound algorithm for the time‐dependent travelling salesman problem A Arigliano, T Calogiuri, G Ghiani, E Guerriero Networks 72 (3), 382-392, 2018 | 33 | 2018 |
| A branch-and-bound algorithm for the time-dependent rural postman problem T Calogiuri, G Ghiani, E Guerriero, R Mansini Computers & Operations Research 102, 150-157, 2019 | 19 | 2019 |
| The multi-period p-center problem with time-dependent travel times T Calogiuri, G Ghiani, E Guerriero, E Manni Computers & Operations Research 136, 105487, 2021 | 8 | 2021 |
| The time‐dependent quickest path problem: Properties and bounds T Calogiuri, G Ghiani, E Guerriero Networks 66 (2), 112-117, 2015 | 7 | 2015 |
| Neighborhood synthesis from an ensemble of MIP and CP models T Adamo, T Calogiuri, G Ghiani, A Grieco, E Guerriero, E Manni Learning and Intelligent Optimization: 10th International Conference, LION …, 2016 | 6 | 2016 |
| HINT project: A BPM teleconsultation and telemonitoring platform A Caforio, T Calogiuri, M Lazoi, G Mitrano, R Paiano Proceedings of the 10th International Conference on Information Systems and …, 2020 | 3 | 2020 |
| A Cloud Telemedicine Platform Based on Workflow Management System: A Review of an Italian Case Study G Mitrano, A Caforio, T Calogiuri, C Colucci, L Mainetti, R Paiano, ... ADVANCES IN SCIENCE, TECHNOLOGY AND ENGINEERING SYSTEMS JOURNAL 7, 87-102, 2022 | | 2022 |
