Juan A. Dı́az

1.1k total citations
24 papers, 789 citations indexed

About

Juan A. Dı́az is a scholar working on Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management and Building and Construction. According to data from OpenAlex, Juan A. Dı́az has authored 24 papers receiving a total of 789 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Industrial and Manufacturing Engineering, 12 papers in Organizational Behavior and Human Resource Management and 6 papers in Building and Construction. Recurrent topics in Juan A. Dı́az's work include Vehicle Routing Optimization Methods (15 papers), Facility Location and Emergency Management (12 papers) and Optimization and Packing Problems (6 papers). Juan A. Dı́az is often cited by papers focused on Vehicle Routing Optimization Methods (15 papers), Facility Location and Emergency Management (12 papers) and Optimization and Packing Problems (6 papers). Juan A. Dı́az collaborates with scholars based in Mexico, Spain and Chile. Juan A. Dı́az's co-authors include Elena Fernández, Ivan Contreras, Maria Albareda-Sambola, Dolores E. Luna, José‐Fernando Camacho‐Vallejo, Roger Z. Rı́os-Mercado, Jordi Pereira, Eduardo Álvarez‐Miranda, Marı́a T. Cortés and Diego Ruiz-Hernández and has published in prestigious journals such as European Journal of Operational Research, Expert Systems with Applications and Journal of the Operational Research Society.

In The Last Decade

Juan A. Dı́az

23 papers receiving 755 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Juan A. Dı́az Mexico 13 642 396 214 112 89 24 789
Pasquale Avella Italy 17 582 0.9× 298 0.8× 138 0.6× 79 0.7× 127 1.4× 37 817
Nader Ghaffarinasab Iran 17 465 0.7× 225 0.6× 116 0.5× 139 1.2× 57 0.6× 28 739
Zorica Stanimirović Serbia 13 390 0.6× 283 0.7× 140 0.7× 71 0.6× 54 0.6× 47 567
Inmaculada Rodrı́guez-Martı́n Spain 14 630 1.0× 209 0.5× 233 1.1× 52 0.5× 52 0.6× 25 738
Gilberto de Miranda Brazil 14 686 1.1× 395 1.0× 238 1.1× 96 0.9× 59 0.7× 27 835
Henrique Pacca Loureiro Luna Brazil 12 415 0.6× 217 0.5× 133 0.6× 70 0.6× 72 0.8× 33 576
Ricardo Saraiva de Camargo Brazil 17 820 1.3× 449 1.1× 266 1.2× 107 1.0× 62 0.7× 31 979
Darko Skorin‐Kapov United States 11 704 1.1× 463 1.2× 216 1.0× 58 0.5× 113 1.3× 26 892
Wolfgang Domschke Germany 14 860 1.3× 117 0.3× 172 0.8× 89 0.8× 147 1.7× 38 1.1k
Pedro Munari Brazil 19 661 1.0× 137 0.3× 139 0.6× 99 0.9× 62 0.7× 54 882

Countries citing papers authored by Juan A. Dı́az

Since Specialization
Citations

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

Fields of papers citing papers by Juan A. Dı́az

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Juan A. Dı́az. 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 Juan A. Dı́az. The network helps show where Juan A. Dı́az may publish in the future.

Co-authorship network of co-authors of Juan A. Dı́az

This figure shows the co-authorship network connecting the top 25 collaborators of Juan A. Dı́az. A scholar is included among the top collaborators of Juan A. Dı́az 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 Juan A. Dı́az. Juan A. Dı́az 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.
Ruiz-Hernández, Diego, et al.. (2023). Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem. Computers & Operations Research. 161. 106418–106418. 3 indexed citations
2.
Álvarez‐Miranda, Eduardo, et al.. (2022). A novel districting design approach for on-time last-mile delivery: An application on an express postal company. Omega. 113. 102687–102687. 16 indexed citations
3.
Contreras, Ivan, et al.. (2020). Integrated cross-dock door assignment and truck scheduling with handling times. Top. 28(3). 705–727. 12 indexed citations
4.
Dı́az, Juan A., et al.. (2019). An improved exact algorithm for a territory design problem with p-center-based dispersion minimization. Expert Systems with Applications. 146. 113150–113150. 7 indexed citations
5.
Dı́az, Juan A. & Dolores E. Luna. (2018). GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence. Journal of the Operational Research Society. 69(9). 1493–1511. 5 indexed citations
6.
Osorio, Mauricio, et al.. (2017). 0-1 Integer Programming for Computing Semi-Stable Semantics of Argumentation Frameworks. Computación y Sistemas. 21(3).
7.
Dı́az, Juan A., et al.. (2017). GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering. Expert Systems with Applications. 82. 67–76. 28 indexed citations
8.
Camacho‐Vallejo, José‐Fernando, et al.. (2017). A bi-level maximal covering location problem. Operational Research. 20(2). 827–855. 20 indexed citations
9.
Rı́os-Mercado, Roger Z., et al.. (2013). A dual bounding scheme for a territory design problem. Computers & Operations Research. 44. 193–205. 11 indexed citations
10.
Dı́az, Juan A., et al.. (2013). A hybrid algorithm for the manufacturing cell formation problem. Journal of Heuristics. 19(1). 77–96. 4 indexed citations
11.
Contreras, Ivan, Juan A. Dı́az, & Elena Fernández. (2010). Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment. INFORMS journal on computing. 23(1). 41–55. 74 indexed citations
12.
Albareda-Sambola, Maria, Juan A. Dı́az, & Elena Fernández. (2009). Lagrangean duals and exact solution to the capacitated p-center problem. European Journal of Operational Research. 201(1). 71–81. 23 indexed citations
13.
Contreras, Ivan, Juan A. Dı́az, & Elena Fernández. (2009). Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum. 31(3). 483–505. 77 indexed citations
14.
Contreras, Ivan & Juan A. Dı́az. (2007). Scatter search for the single source capacitated facility location problem. Annals of Operations Research. 157(1). 73–89. 38 indexed citations
15.
Dı́az, Juan A. & Elena Fernández. (2004). Hybrid scatter search and path relinking for the capacitated p-median problem. European Journal of Operational Research. 169(2). 570–585. 73 indexed citations
16.
Albareda-Sambola, Maria, Juan A. Dı́az, & Elena Fernández. (2003). A compact model and tight bounds for a combined location-routing problem. Computers & Operations Research. 32(3). 407–428. 137 indexed citations
17.
Dı́az, Juan A. & Elena Fernández. (2002). A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem. Journal of the Operational Research Society. 53(7). 728–740. 49 indexed citations
18.
Dı́az, Juan A. & Elena Fernández. (2001). A Tabu search heuristic for the generalized assignment problem. European Journal of Operational Research. 132(1). 22–38. 107 indexed citations
19.
Dı́az, Juan A., et al.. (1999). Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem. INFOR Information Systems and Operational Research. 37(3). 194–225. 71 indexed citations
20.
Acevedo‐Arozena, Abraham, et al.. (1991). [Severe ischemia of the hand. Treatment with regional intravenous sympathicolysis with reserpine].. PubMed. 119(4). 412–7. 1 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