World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
37
Citations
5717
World Ranking
10768
National Ranking
335

Roberto Tadei publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Roberto Tadei sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 161 publications — 31st percentile

31% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Roberto Tadei D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Roberto Tadei sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 37 D-Index — 27th percentile

27% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Roberto Tadei is affiliated with the Polytechnic University of Turin in Italy. Their research primarily spans the fields of Engineering and Computer Science, with a focus on Industrial and Manufacturing Engineering, Transportation, Building and Construction, Computer Networks and Communications, and Artificial Intelligence.

The main topics covered in their work include:

  • Scheduling and Optimization Algorithms
  • Vehicle Routing Optimization Methods
  • Urban and Freight Transport Logistics
  • Maritime Ports and Logistics
  • Optimization and Search Problems
  • Advanced Manufacturing and Logistics Optimization
  • Facility Location and Emergency Management

Roberto Tadei has contributed to publications in multiple venues, with frequent appearances in:

  • Computers & Operations Research
  • Annals of Computer Science and Information Systems
  • The International Journal of Advanced Manufacturing Technology
  • Transportation Research Part E Logistics and Transportation Review
  • Networks

Their recent papers include:

  • "Machine learning and optimization for production rescheduling in Industry 4.0" (2020), published in The International Journal of Advanced Manufacturing Technology
  • "Comparative analysis of models and performance indicators for optimal service facility location" (2020), published in Transportation Research Part E Logistics and Transportation Review
  • "Multiperiod transshipment location-allocation problem with flow synchronization under stochastic handling operations" (2020), published in Networks
  • "Reinforcement Learning Algorithms for Online Single-Machine Scheduling" (2020), published in Annals of Computer Science and Information Systems
  • "The Synchronized Location-Transshipment Problem" (2021), published in Transportation Research Procedia

Collaborations feature frequent coauthors such as:

  • Daniele Manerba
  • Edoardo Fadda
  • Olivier Terzo
  • Riccardo Giusti
  • Mina Roohnavazfar

Best Publications

  • A genetic algorithm for the job shop problem

    Federico Della Croce;Roberto Tadei;Giuseppe Volta

  • The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics

    Guido Perboli;Roberto Tadei;Daniele Vigo

  • Extreme Point-Based Heuristics for Three-Dimensional Bin Packing

    Teodor Gabriel Crainic;Guido Perboli;Roberto Tadei

  • Two-Echelon Vehicle Routing Problem: A satellite location analysis

    Teodor Gabriel Crainic;Teodor Gabriel Crainic;Guido Perboli;Guido Perboli;Simona Mancini;Simona Mancini;Roberto Tadei

  • Synchromodal logistics: An overview of critical success factors, enabling technologies, and open research issues

    Riccardo Giusti;Daniele Manerba;Giorgio Bruno;Roberto Tadei

  • TS2PACK: A two-level tabu search for the three-dimensional bin packing problem

    Teodor Gabriel Crainic;Guido Perboli;Roberto Tadei

  • The two-machine total completion time flow shop problem

    F. Della Croce;V. Narayan;R. Tadei

  • A greedy-based neighborhood search approach to a nurse rostering problem

    F. Bellanti;Giuliana Carello;F. Della Croce;R. Tadei

  • Multi-start heuristics for the two-echelon vehicle routing problem

    Teodor Gabriel Crainic;Simona Mancini;Guido Perboli;Roberto Tadei

  • New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem

    Guido Perboli;Roberto Tadei

  • Efficient lower bounds and heuristics for the variable cost and size bin packing problem

    Teodor Gabriel Crainic;Guido Perboli;Walter Rei;Roberto Tadei

  • The two-echelon capacitated vehicle routing problem

    Jesus Gonzalez-Feliu;Guido Perboli;Roberto Tadei;Daniele Vigo

  • Solving the Hub location problem in telecommunication network design: A local search approach

    G. Carello;F. Della Croce;Marco Ghirardi;Roberto Tadei

  • An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem

    A Grosso;F Della Croce;R Tadei

  • An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

    F. Della Croce;Marco Ghirardi;Roberto Tadei

  • Machine learning and optimization for production rescheduling in Industry 4.0

    Yuanyuan Li;Stefano Carabelli;Edoardo Fadda;Daniele Manerba

  • Clustering-based heuristics for the two-echelon vehicle routing problem

    Teodor Gabriel Crainic;Simona Mancini;Guido Perboli;Roberto Tadei

  • Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

    F. Della Croce;M. Ghirardi;R. Tadei

  • The Generalized Bin Packing Problem

    Mauro Maria Baldi;Teodor Gabriel Crainic;Guido Perboli;Roberto Tadei

  • Real-time task sheduling with fuzzy deadlines and processing times

    Marin Litoiu;Roberto Tadei

  • A Generalized Bin Packing Problem for parcel delivery in last-mile logistics

    Mauro Maria Baldi;Daniele Manerba;Guido Perboli;Roberto Tadei

  • Solving the hub location problem in telecommunication network design: a local search approach

    G. Carello;Federico Della Croce Di Dojola;Marco Ghirardi;Roberto Tadei

Frequent Co-Authors

Guido Perboli
Guido Perboli Polytechnic University of Turin
Teodor Gabriel Crainic
Teodor Gabriel Crainic University of Quebec at Montreal
Marin Litoiu
Marin Litoiu York University
Mauro Dell'Amico
Mauro Dell'Amico University of Modena and Reggio Emilia
Daniele Vigo
Daniele Vigo University of Bologna
Jatinder N. D. Gupta
Jatinder N. D. Gupta University of Alabama in Huntsville
Nicola Bellomo
Nicola Bellomo University of Granada

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens the door to many related fields and flexible learning options. Online programs make it easier for students everywhere to pursue technology-oriented careers, often at a reduced cost and faster pace.

For those interested in diverse job prospects, consider pairing Computer Science with other disciplines. For example, there is a growing demand for specialized jobs with elementary education and environmental science degree, especially as environmental challenges rise.

If you’re looking for flexible ways to earn your qualification, an computer science accelerated program could help you fast-track your studies and start working sooner.

Expanding beyond Computer Science, you can also explore affordable, reputable online degree options in related technical fields. For those fascinated by the intersection of technology and the environment, environmental engineering degrees online offer strong career potential. Similarly, an online degree in mechanical engineering provides versatile skills relevant to industries ranging from automation to energy.

With flexible online options, you can tailor your education to your career goals, regardless of where you begin.

Best Scientists Citing Roberto Tadei

Trending Scientists