Eduardo Uchoa

4.6k total citations · 1 hit paper
85 papers, 2.8k citations indexed

About

Eduardo Uchoa is a scholar working on Industrial and Manufacturing Engineering, Automotive Engineering and Computer Networks and Communications. According to data from OpenAlex, Eduardo Uchoa has authored 85 papers receiving a total of 2.8k indexed citations (citations by other indexed papers that have themselves been cited), including 67 papers in Industrial and Manufacturing Engineering, 23 papers in Automotive Engineering and 17 papers in Computer Networks and Communications. Recurrent topics in Eduardo Uchoa's work include Vehicle Routing Optimization Methods (59 papers), Optimization and Packing Problems (38 papers) and Transportation and Mobility Innovations (23 papers). Eduardo Uchoa is often cited by papers focused on Vehicle Routing Optimization Methods (59 papers), Optimization and Packing Problems (38 papers) and Transportation and Mobility Innovations (23 papers). Eduardo Uchoa collaborates with scholars based in Brazil, France and United States. Eduardo Uchoa's co-authors include Artur Alves Pessoa, Anand Subramanian, Marcus Poggi de Aragão, Luiz Satoru Ochi, Ruslan Sadykov, Marcus Poggi, Diego Pecin, Renato F. Werneck, Humberto J. Longo and Ricardo Fukasawa and has published in prestigious journals such as European Journal of Operational Research, Expert Systems with Applications and Operations Research.

In The Last Decade

Eduardo Uchoa

78 papers receiving 2.6k citations

Hit Papers

New benchmark instances for the Capacitated Vehicle Routi... 2016 2026 2019 2022 2016 50 100 150 200 250

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Eduardo Uchoa Brazil 28 2.3k 937 635 338 318 85 2.8k
Anand Subramanian Brazil 29 2.0k 0.9× 1.1k 1.2× 716 1.1× 240 0.7× 352 1.1× 96 2.8k
Juan‐José Salazar‐González Spain 34 2.7k 1.2× 1.0k 1.1× 835 1.3× 266 0.8× 495 1.6× 105 3.4k
Luiz Satoru Ochi Brazil 23 1.7k 0.7× 673 0.7× 566 0.9× 313 0.9× 448 1.4× 118 2.3k
Manuel Iori Italy 36 3.0k 1.3× 757 0.8× 648 1.0× 354 1.0× 180 0.6× 122 4.0k
Thibaut Vidal Brazil 28 3.1k 1.3× 1.6k 1.7× 1.2k 1.8× 183 0.5× 491 1.5× 69 3.7k
Moshe Dror United States 35 3.0k 1.3× 1.2k 1.3× 876 1.4× 421 1.2× 314 1.0× 124 4.1k
Elena Fernández Spain 34 2.1k 0.9× 486 0.5× 831 1.3× 226 0.7× 156 0.5× 97 2.8k
Christelle Guéret France 17 1.6k 0.7× 1.1k 1.1× 522 0.8× 209 0.6× 181 0.6× 24 2.2k
Jakob Puchinger France 22 1.5k 0.7× 1.5k 1.6× 689 1.1× 216 0.6× 337 1.1× 57 3.0k
Walter Rei Canada 25 1.7k 0.7× 801 0.9× 661 1.0× 125 0.4× 169 0.5× 56 2.5k

Countries citing papers authored by Eduardo Uchoa

Since Specialization
Citations

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

Fields of papers citing papers by Eduardo Uchoa

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Eduardo Uchoa

This figure shows the co-authorship network connecting the top 25 collaborators of Eduardo Uchoa. A scholar is included among the top collaborators of Eduardo Uchoa 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 Eduardo Uchoa. Eduardo Uchoa is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Uchoa, Eduardo, et al.. (2025). Cluster Branching for Vehicle Routing Problems. INFORMS journal on computing.
2.
Mahjoub, A. Ridha, et al.. (2025). The multiple steiner TSP with cyclic order on terminals: valid inequalities and polyhedra. Journal of Combinatorial Optimization. 49(5).
3.
Pessoa, Artur Alves, et al.. (2024). On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables. Operations Research Letters. 58. 107209–107209.
4.
Uchoa, Eduardo, et al.. (2024). Branch-cut-and-price algorithms for two routing problems with hotel selection. Computers & Industrial Engineering. 196. 110467–110467. 2 indexed citations
5.
Subramanian, Anand, et al.. (2023). A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery. Computers & Operations Research. 162. 106467–106467. 11 indexed citations
6.
Sadykov, Ruslan, et al.. (2023). Code and Data Repository for VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem. INFORMS journal on computing. 1 indexed citations
7.
Subramanian, Anand, et al.. (2023). On time-indexed formulations for the parallel machine scheduling problem with a common server. Engineering Optimization. 1–18. 5 indexed citations
8.
Uchoa, Eduardo, et al.. (2022). A unified exact approach for Clustered and Generalized Vehicle Routing Problems. Computers & Operations Research. 149. 106040–106040. 10 indexed citations
9.
Uchoa, Eduardo, et al.. (2021). A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. 4OR. 21(1). 47–71. 10 indexed citations
10.
Pessoa, Artur Alves, Ruslan Sadykov, Eduardo Uchoa, & François Vanderbeck. (2020). A generic exact solver for vehicle routing and related problems. Mathematical Programming. 183(1-2). 483–523. 112 indexed citations
11.
Mahjoub, A. Ridha, et al.. (2019). A layered compact formulation for the Multiple Steiner TSP with Order constraints. HAL (Le Centre pour la Communication Scientifique Directe). 1462–1467. 4 indexed citations
12.
Mahjoub, Ali Ridha, et al.. (2019). Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut. Discrete Optimization. 35. 100555–100555. 4 indexed citations
14.
Pecin, Diego & Eduardo Uchoa. (2019). Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm. Transportation Science. 53(6). 1673–1694. 12 indexed citations
15.
Sadykov, Ruslan, et al.. (2018). A branch-and-price algorithm for the Minimum Latency Problem. Computers & Operations Research. 93. 66–78. 34 indexed citations
16.
Pessoa, Artur Alves, Ruslan Sadykov, & Eduardo Uchoa. (2018). Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems. European Journal of Operational Research. 270(2). 530–543. 37 indexed citations
17.
Uchoa, Eduardo, Diego Pecin, Artur Alves Pessoa, et al.. (2016). New benchmark instances for the Capacitated Vehicle Routing Problem. European Journal of Operational Research. 257(3). 845–858. 277 indexed citations breakdown →
18.
Subramanian, Anand, Eduardo Uchoa, & Luiz Satoru Ochi. (2013). A hybrid algorithm for a class of vehicle routing problems. Computers & Operations Research. 40(10). 2519–2531. 188 indexed citations
19.
Petrucci, Vinícius, et al.. (2011). A column generation approach for power-aware optimization of virtualized heterogeneous server clusters. Computers & Industrial Engineering. 63(3). 652–662. 15 indexed citations
20.
Poggi, Marcus, et al.. (2010). The Team Orienteering Problem: Formulations and Branch-Cut and Price. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 31 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

Rankless by CCL
2026