Paolo Dell’Olmo

2.3k total citations
77 papers, 1.4k citations indexed

About

Paolo Dell’Olmo is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Paolo Dell’Olmo has authored 77 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Industrial and Manufacturing Engineering, 34 papers in Computer Networks and Communications and 16 papers in Management Science and Operations Research. Recurrent topics in Paolo Dell’Olmo's work include Scheduling and Optimization Algorithms (27 papers), Advanced Manufacturing and Logistics Optimization (12 papers) and Vehicle Routing Optimization Methods (12 papers). Paolo Dell’Olmo is often cited by papers focused on Scheduling and Optimization Algorithms (27 papers), Advanced Manufacturing and Logistics Optimization (12 papers) and Vehicle Routing Optimization Methods (12 papers). Paolo Dell’Olmo collaborates with scholars based in Italy, Poland and United States. Paolo Dell’Olmo's co-authors include Massimiliano Caramia, Stefano Giordani, M. Grazia Speranza, Lucio Bianco, L. Bianco, Maciej Drozdowski, Guglielmo Lulli, Monica Gentili, Jacek Błażewicz and Andrea Scozzari and has published in prestigious journals such as European Journal of Operational Research, IEEE Communications Magazine and Operations Research.

In The Last Decade

Paolo Dell’Olmo

76 papers receiving 1.3k citations

Peers

Paolo Dell’Olmo

IME

CNC

MSOR

GEEF

Brian Rodrigues Singapore

Karla Hoffman United States

M. Seli̇m Aktürk Türkiye

Lucio Bianco Italy

Fabio Furini France

Alper Atamtürk United States

David M. Ryan New Zealand

Miquel Àngel Piera Spain

Julia A. Bennell United Kingdom

Yvan Dumas Canada

Brian Rodrigues Singapore

Paolo Dell’Olmo

1.1k ×1.6

IME

222 ×0.6

CNC

139 ×0.4

296 ×1.3

MSOR

112 ×0.6

GEEF

Citations per year, relative to Paolo Dell’Olmo Paolo Dell’Olmo (= 1×) peers Brian Rodrigues

Countries citing papers authored by Paolo Dell’Olmo

Since Specialization

Citations

This map shows the geographic impact of Paolo Dell’Olmo'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 Paolo Dell’Olmo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paolo Dell’Olmo more than expected).

Fields of papers citing papers by Paolo Dell’Olmo

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Paolo Dell’Olmo. 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 Paolo Dell’Olmo. The network helps show where Paolo Dell’Olmo may publish in the future.

Co-authorship network of co-authors of Paolo Dell’Olmo

This figure shows the co-authorship network connecting the top 25 collaborators of Paolo Dell’Olmo. A scholar is included among the top collaborators of Paolo Dell’Olmo 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 Paolo Dell’Olmo. Paolo Dell’Olmo 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

Dell’Olmo, Paolo, et al.. (2023). An integrated model for high-speed rolling-stock planning and maintenance scheduling. Engineering Optimization. 56(6). 811–832. 2 indexed citations

Caramia, Massimiliano & Paolo Dell’Olmo. (2020). Multi-objective Management in Freight Logistics. Cineca Institutional Research Information System (Tor Vergata University). 18 indexed citations

Dell’Olmo, Paolo, et al.. (2018). Mathematical Models for On-Line Train Calendars Generation. Computers & Operations Research. 102. 1–9. 2 indexed citations

Chiaraviglio, Luca, et al.. (2015). Sleep to stay alive: Optimizing reliability in energy-efficient backbone networks. IRIS Research product catalog (Sapienza University of Rome). 1–4. 5 indexed citations

Caramia, Massimiliano & Paolo Dell’Olmo. (2007). Coloring graphs by iterated local search traversing feasible and infeasible solutions. Discrete Applied Mathematics. 156(2). 201–217. 28 indexed citations

Bianco, Lucio, Paolo Dell’Olmo, & Stefano Giordani. (2006). Scheduling models for air traffic control in terminal areas. Journal of Scheduling. 9(3). 223–253. 89 indexed citations

Caramia, Massimiliano, Paolo Dell’Olmo, & Giuseppe F. Italiano. (2005). CHECKCOL: Improved local search for graph coloring. Journal of Discrete Algorithms. 4(2). 277–298. 13 indexed citations

Dell’Olmo, Paolo, Pierre Hansen, Stefano Pallottino, & Giovanni Storchi. (2005). On uniform k-partition problems. Discrete Applied Mathematics. 150(1-3). 121–139. 5 indexed citations

Caramia, Massimiliano, Paolo Dell’Olmo, & Antonio Iovanella. (2005). Lower bound algorithms for multiprocessor task scheduling with ready times. International Transactions in Operational Research. 12(5). 481–508. 2 indexed citations

10.

Confessore, Giuseppe, Paolo Dell’Olmo, & Monica Gentili. (2004). Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem. Computers & Operations Research. 32(9). 2383–2405. 7 indexed citations

11.

Caramia, Massimiliano & Paolo Dell’Olmo. (2003). Assessing the resource usage in scheduling with incompatibilities. OR Spectrum. 25(4). 521–547. 6 indexed citations

12.

Caramia, Massimiliano, Paolo Dell’Olmo, & Antonio Iovanella. (2001). On-line algorithms for multiprocessor task scheduling with ready times. Foundations of Computing and Decision Sciences. 197–214. 1 indexed citations

13.

Caramia, Massimiliano & Paolo Dell’Olmo. (2001). A lower bound on the chromatic number of Mycielski graphs. Discrete Mathematics. 235(1-3). 79–86. 21 indexed citations

14.

Dell’Olmo, Paolo & M. Grazia Speranza. (1999). Approximation algorithms for partitioning small items in unequal bins to minimize the total size. Discrete Applied Mathematics. 94(1-3). 181–191. 16 indexed citations

15.

Dell’Olmo, Paolo, M. Grazia Speranza, & Zs. Tuza. (1997). Comparability graph augmentation for some multiprocessor scheduling problems. Discrete Applied Mathematics. 72(1-2). 71–84. 8 indexed citations

16.

Bianco, L., Paolo Dell’Olmo, & Stefano Giordani. (1997). An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets. Computational Optimization and Applications. 8(2). 197–210. 1 indexed citations

17.

Dell’Olmo, Paolo, Stefano Giordani, & M. Grazia Speranza. (1997). An approximation result for a duo-processor task scheduling problem. Information Processing Letters. 61(4). 195–200. 5 indexed citations

18.

Dell’Olmo, Paolo & Pitu B. Mirchandani. (1995). REALBAND : an approach for real-time coordination of traffic flows on networks. Transportation Research Record Journal of the Transportation Research Board. 106–116. 38 indexed citations

19.

Bianco, L., Jacek Błażewicz, Paolo Dell’Olmo, & Maciej Drozdowski. (1995). Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors. Annals of Operations Research. 58(7). 493–517. 21 indexed citations

20.

Bianco, L., Paolo Dell’Olmo, & M. Grazia Speranza. (1995). Scheduling independent tasks with multiple modes. Discrete Applied Mathematics. 62(1-3). 35–50. 9 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