Prof. Roberto Montemanni

Department of Sciences and Methods for Engineering (DISMI)

University of Modena and Reggio Emilia (UNIMORE), Italy

Email: roberto.montemanni@unimore.it

Qualifications

2002  Ph.D., University of Glamorgan, UK

Publications (Selected)

1. Montemanni, Roberto & Smith, Derek. (2025). An Exact Algorithm for the Hazardous Orienteering Problem. Networks. 10.1002/net.22279. 
2. Montemanni, Roberto & Smith, Derek. (2025). Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem. Computers & Operations Research. 178. 107010. 10.1016/j.cor.2025.107010. 
3. Montemanni, Roberto & Ceschia, Sara & Schaerf, Andrea. (2024). A Compact Model for the Home Healthcare Routing and Scheduling Problem. EURO Journal on Computational Optimization. 13. 100101. 10.1016/j.ejco.2024.100101. 
4. Montemanni, Roberto & Smith, Derek. (2024). A model-based algorithm for the Probabilistic Orienteering Problem. Computers & Operations Research. 176. 106947. 10.1016/j.cor.2024.106947. 
5. Smith, Derek & Montemanni, Roberto. (2024). Potential Subgraphs of the Missing Moore Graph. Symmetry. 16. 1563. 10.3390/sym16121563. 
6. Montemanni, Roberto & Dell'Amico, Mauro & Corsini, Andrea. (2024). Modeling the Parallel Drone Scheduling Vehicle Routing Problem as a Heterogeneous Vehicle Routing Problem. 410-415. 10.1145/3654522.3654566. 
7. Montemanni, Roberto & Dell'Amico, Mauro & Corsini, Andrea. (2024). Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones. 10.1007/978-3-031-62912-9_13. 
8. Montemanni, Roberto & Smith, Derek. (2024). A Compact Model for the Clustered Orienteering Problem. Logistics. 8. 48. 10.3390/logistics8020048. 
9. Dell’Amico, M., Jamal, J., & Montemanni, R. (2024). Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times. Algorithms, 17(1), 12. https://doi.org/10.3390/a17010012
10. Montemanni, R., & Dell’Amico, M. (2023). Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming. Algorithms, 16(1), 40. https://doi.org/10.3390/a16010040
11. Smith, Derek & Montemanni, Roberto. (2023). The missing Moore graph as an optimization problem. EURO Journal on Computational Optimization. 11. 100060. 10.1016/j.ejco.2023.100060. 
12. Pugliese, G., Chou, X., Loske, D., Klumpp, M., & Montemanni, R. (2022). AMR-Assisted Order Picking: Models for Picker-to-Parts Systems in a Two-Blocks Warehouse. Algorithms, 15(11), 413. https://doi.org/10.3390/a15110413
13. Montemanni, Roberto & Chou, Xiaochen & Smith, Derek. (2022). Upper and Lower Bounds based on Linear Programming for the B-Coloring Problem. EURO Journal on Computational Optimization. 10. 100049. 10.1016/j.ejco.2022.100049. 
14. Barta, J., Montemanni, R. The Maximum Clique Problem for Permutation Hamming Graphs. J Optim Theory Appl 194, 492–507 (2022). https://doi.org/10.1007/s10957-022-02035-w
15. Dell'Amico, M., Montemanni, R. and Novellani, S. (2022), Exact models for the flying sidekick traveling salesman problem. Intl. Trans. in Op. Res., 29: 1360-1393. https://doi.org/10.1111/itor.13030
16. Pietri, N. O., Chou, X., Loske, D., Klumpp, M., & Montemanni, R. (2021). The Buy-Online-Pick-Up-in-Store Retailing Model: Optimization Strategies for In-Store Picking and Packing. Algorithms, 14(12), 350. https://doi.org/10.3390/a14120350
17. Dell'Amico M, Montemanni R, Novellani S. Modeling the flying sidekick traveling salesman problem with multiple drones. Networks.. 2021; 78: 303–327. https://doi.org/10.1002/net.22022
18. Mele, U. J., Gambardella, L. M., & Montemanni, R. (2021). A New Constructive Heuristic Driven by Machine Learning for the Traveling Salesman Problem. Algorithms, 14(9), 267. https://doi.org/10.3390/a14090267
19. Di Caro, G.A., Maniezzo, V., Montemanni, R. et al. Machine learning and combinatorial optimization, editorial. OR Spectrum 43, 603–605 (2021). https://doi.org/10.1007/s00291-021-00642-z
20. Ognibene Pietri, N., Chou, X., Loske, D., Klumpp, M., Jamal, J., Montemanni, R. (2022). The Picking and Packing Problem in Buy-Online-Pick-up-in-Store Retailing. In: Trautmann, N., Gnägi, M. (eds) Operations Research Proceedings 2021. OR 2021. Lecture Notes in Operations Research. Springer, Cham. https://doi.org/10.1007/978-3-031-08623-6_36

Profile Details

https://personale.unimore.it/rubrica/dettaglio/monteman