Roberto Montemanni

4.5k total citations
152 papers, 2.9k citations indexed

About

Roberto Montemanni is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Roberto Montemanni has authored 152 papers receiving a total of 2.9k indexed citations (citations by other indexed papers that have themselves been cited), including 86 papers in Industrial and Manufacturing Engineering, 43 papers in Computer Networks and Communications and 35 papers in Artificial Intelligence. Recurrent topics in Roberto Montemanni's work include Vehicle Routing Optimization Methods (66 papers), Optimization and Packing Problems (32 papers) and Metaheuristic Optimization Algorithms Research (19 papers). Roberto Montemanni is often cited by papers focused on Vehicle Routing Optimization Methods (66 papers), Optimization and Packing Problems (32 papers) and Metaheuristic Optimization Algorithms Research (19 papers). Roberto Montemanni collaborates with scholars based in Switzerland, Italy and United Kingdom. Roberto Montemanni's co-authors include Luca Maria Gambardella, Andrea Emilio Rizzoli, Derek H. Smith, Mauro Dell’Amico, L. M. Gambardella, Abele Donati, Stefano Novellani, Alberto Donati, Dennis Weyland and Stuart M. Allen and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and European Journal of Operational Research.

In The Last Decade

Roberto Montemanni

141 papers receiving 2.7k citations

Peers

Roberto Montemanni

IME

CNC

Hoong Chuin Lau Singapore

Mauro Dell’Amico Italy

Günther R. Raidl Austria

Eduardo Uchoa Brazil

Juan‐José Salazar‐González Spain

Luiz Satoru Ochi Brazil

Yannis Marinakis Greece

El‐Ghazali Talbi France

José Andrés Moreno Pérez Spain

Anand Subramanian Brazil

Hoong Chuin Lau Singapore

Roberto Montemanni

1.2k ×0.7

IME

568 ×0.9

432 ×0.7

404 ×0.7

CNC

426 ×1.2

Citations per year, relative to Roberto Montemanni Roberto Montemanni (= 1×) peers Hoong Chuin Lau

Countries citing papers authored by Roberto Montemanni

Since Specialization

Citations

This map shows the geographic impact of Roberto Montemanni's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Roberto Montemanni with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Roberto Montemanni more than expected).

Fields of papers citing papers by Roberto Montemanni

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Roberto Montemanni. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Roberto Montemanni. The network helps show where Roberto Montemanni may publish in the future.

Co-authorship network of co-authors of Roberto Montemanni

This figure shows the co-authorship network connecting the top 25 collaborators of Roberto Montemanni. A scholar is included among the top collaborators of Roberto Montemanni based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Roberto Montemanni. Roberto Montemanni is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Montemanni, Roberto & Derek H. Smith. (2025). Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem. Computers & Operations Research. 178. 107010–107010. 1 indexed citations

Montemanni, Roberto & Derek H. Smith. (2025). On Solving the Maximum Flow Problem with Conflict Constraints. IRIS UNIMORE (University of Modena and Reggio Emilia). 69–74.

Montemanni, Roberto & Derek H. Smith. (2024). A model-based algorithm for the Probabilistic Orienteering Problem. Computers & Operations Research. 176. 106947–106947. 1 indexed citations

Montemanni, Roberto & Derek H. Smith. (2024). A Compact Model for the Clustered Orienteering Problem. SHILAP Revista de lepidopterología. 8(2). 48–48.

Montemanni, Roberto, Sara Ceschia, & Andrea Schaerf. (2024). A compact model for the home healthcare routing and scheduling problem. SHILAP Revista de lepidopterología. 13. 100101–100101. 3 indexed citations

Dell’Amico, Mauro, et al.. (2023). Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times. Algorithms. 17(1). 12–12. 1 indexed citations

Montemanni, Roberto & Mauro Dell’Amico. (2023). Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming. Algorithms. 16(1). 40–40. 18 indexed citations

Dell’Amico, Mauro, et al.. (2023). Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times. SHILAP Revista de lepidopterología. 35. 421–430. 1 indexed citations

Dell’Amico, Mauro, Roberto Montemanni, & Stefano Novellani. (2023). Pickup and delivery with lockers. Transportation Research Part C Emerging Technologies. 148. 104022–104022. 17 indexed citations

10.

Kedaigle, Amanda J., et al.. (2017). PCSF: An R-package for network-based interpretation of high-throughput data. PLoS Computational Biology. 13(7). e1005694–e1005694. 34 indexed citations

11.

Montemanni, Roberto, et al.. (2017). A Multi-Modal and Multi-Objective Journey Planner for Integrating Carpooling and Public Transport. 9 indexed citations

12.

Montemanni, Roberto, et al.. (2015). The Orienteering Problem with Stochastic Travel and Service Times New approaches to sampling-based objective function evaluation. 2 indexed citations

13.

Montemanni, Roberto, et al.. (2015). A comparison of two exact algorithms for the sequential ordering problem. IRIS UNIMORE (University of Modena and Reggio Emilia). 73–78. 12 indexed citations

14.

Montemanni, Roberto, et al.. (2013). An ant colony system for the capacitated vehicle routing problem with uncertain travel costs. IRIS UNIMORE (University of Modena and Reggio Emilia). 32–39. 17 indexed citations

15.

Smith, Derek H., et al.. (2010). Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content. Discrete Mathematics. 311(13). 1207–1219. 14 indexed citations

16.

Montemanni, Roberto & L. M. Gambardella. (2009). An ant colony system for team orienteering problems with time windows. Foundations of Computing and Decision Sciences. 34(4). 287–306. 90 indexed citations

17.

Negri, Luca, Davide Zanetti, Roberto Montemanni, & Silvia Giordano. (2008). Power-Optimized Topology Formation and Configuration in Bluetooth Sensor Networks: An Experimental Approach.. Ad Hoc & Sensor Wireless Networks. 6. 145–175. 4 indexed citations

18.

Babaoğlu, Özalp, Geoffrey Canright, Andreas Deutsch, et al.. (2005). Design Patterns from Biology for Distributed Computing. Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna). 1. 1–27. 20 indexed citations

19.

Montemanni, Roberto, Luca Maria Gambardella, Andrea Emilio Rizzoli, & Abele Donati. (2005). Ant Colony System for a Dynamic Vehicle Routing Problem. Journal of Combinatorial Optimization. 10(4). 327–343. 272 indexed citations

20.

Montemanni, Roberto, et al.. (2004). Ant Colony Optimisation for vehicle routing problems: from theory to applications.. IRIS UNIMORE (University of Modena and Reggio Emilia). 1(3). 1–50. 10 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact