Alfredo Marı́n

1.9k total citations
57 papers, 1.3k citations indexed

About

Alfredo Marı́n is a scholar working on Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management and Building and Construction. According to data from OpenAlex, Alfredo Marı́n has authored 57 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Industrial and Manufacturing Engineering, 40 papers in Organizational Behavior and Human Resource Management and 16 papers in Building and Construction. Recurrent topics in Alfredo Marı́n's work include Vehicle Routing Optimization Methods (43 papers), Facility Location and Emergency Management (40 papers) and Urban and Freight Transport Logistics (13 papers). Alfredo Marı́n is often cited by papers focused on Vehicle Routing Optimization Methods (43 papers), Facility Location and Emergency Management (40 papers) and Urban and Freight Transport Logistics (13 papers). Alfredo Marı́n collaborates with scholars based in Spain, France and Belgium. Alfredo Marı́n's co-authors include Mercedes Landete, Sergio García, Elena Fernández, Ivan Contreras, Blas Pelegrı́n, Martine Labbé, Antonio M. Rodríguez‐Chía, Justo Puerto, Stefan Nickel and Laureano F. Escudero and has published in prestigious journals such as European Journal of Operational Research, Expert Systems with Applications and Decision Support Systems.

In The Last Decade

Alfredo Marı́n

56 papers receiving 1.3k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Alfredo Marı́n Spain 22 987 907 375 245 151 57 1.3k
Barbaros Ç. Tansel Türkiye 16 784 0.8× 781 0.9× 240 0.6× 268 1.1× 116 0.8× 35 1.4k
Masoud Hekmatfar Iran 5 649 0.7× 516 0.6× 280 0.7× 224 0.9× 116 0.8× 5 1.0k
Ivan Contreras Canada 25 1.6k 1.6× 989 1.1× 563 1.5× 551 2.2× 229 1.5× 49 2.0k
John G. Klincewicz United States 18 882 0.9× 530 0.6× 260 0.7× 228 0.9× 82 0.5× 39 1.4k
Andreas Klose Denmark 13 628 0.6× 619 0.7× 383 1.0× 114 0.5× 151 1.0× 23 1.1k
Roberto D. Galvão Brazil 22 1.0k 1.0× 947 1.0× 449 1.2× 230 0.9× 133 0.9× 41 1.5k
Jadranka Skorin‐Kapov United States 12 1.1k 1.1× 464 0.5× 259 0.7× 235 1.0× 92 0.6× 39 1.4k
Oya Ekin Karaşan Türkiye 23 1.1k 1.1× 378 0.4× 318 0.8× 301 1.2× 165 1.1× 50 1.7k
Luce Brotcorne France 16 425 0.4× 494 0.5× 301 0.8× 303 1.2× 179 1.2× 40 1.2k
Turgut Aykin United States 9 1.1k 1.1× 626 0.7× 321 0.9× 385 1.6× 106 0.7× 11 1.3k

Countries citing papers authored by Alfredo Marı́n

Since Specialization
Citations

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

Fields of papers citing papers by Alfredo Marı́n

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Alfredo Marı́n

This figure shows the co-authorship network connecting the top 25 collaborators of Alfredo Marı́n. A scholar is included among the top collaborators of Alfredo Marı́n 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 Alfredo Marı́n. Alfredo Marı́n 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.
Marı́n, Alfredo, et al.. (2025). Exact solution method for stochastic single-allocation hub location problems. Transportation Research Part E Logistics and Transportation Review. 202. 104295–104295.
2.
Labbé, Martine, et al.. (2020). Finding the root graph through minimum edge deletion. European Journal of Operational Research. 289(1). 59–74. 1 indexed citations
3.
Carrizosa, Emilio, et al.. (2020). Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality. IEEE Systems Journal. 14(3). 3916–3925. 4 indexed citations
4.
Domínguez, Enrique & Alfredo Marı́n. (2020). Discrete ordered median problem with induced order. Top. 28(3). 793–813. 2 indexed citations
5.
Albareda-Sambola, Maria, Alfredo Marı́n, & Antonio M. Rodríguez‐Chía. (2019). Reformulated acyclic partitioning for rail-rail containers transshipment. European Journal of Operational Research. 277(1). 153–165. 3 indexed citations
6.
Marı́n, Alfredo, et al.. (2018). Multi-period stochastic covering location problems: Modeling framework and solution approach. European Journal of Operational Research. 268(2). 432–449. 23 indexed citations
7.
Landete, Mercedes, et al.. (2017). Decomposition methods based on articulation vertices for degree-dependent spanning tree problems. Computational Optimization and Applications. 68(3). 749–773. 4 indexed citations
8.
Marı́n, Alfredo. (2015). Exact and heuristic solutions for the Minimum Number of Branch Vertices Spanning Tree Problem. European Journal of Operational Research. 245(3). 680–689. 9 indexed citations
9.
Landete, Mercedes & Alfredo Marı́n. (2013). Looking for edge-equitable spanning trees. Computers & Operations Research. 41. 44–52. 14 indexed citations
10.
Marı́n, Alfredo, et al.. (2009). A flexible model and efficient solution strategies for discrete location problems. LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). 56 indexed citations
11.
Marı́n, Alfredo. (2009). Discrete location for bundled demand points. Top. 18(1). 242–256. 1 indexed citations
12.
Contreras, Ivan, Elena Fernández, & Alfredo Marı́n. (2009). Lagrangean bounds for the optimum communication spanning tree problem. Top. 18(1). 140–157. 9 indexed citations
13.
Marı́n, Alfredo, et al.. (2008). A comparison of formulations and solution methods for the minimum-envy location problem. Computers & Operations Research. 36(6). 1966–1981. 33 indexed citations
14.
Contreras, Ivan, Elena Fernández, & Alfredo Marı́n. (2008). Tight bounds from a path based formulation for the tree of hub location problem. Computers & Operations Research. 36(12). 3117–3127. 73 indexed citations
15.
García, Sergio, et al.. (2006). Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. European Journal of Operational Research. 179(3). 990–1007. 52 indexed citations
16.
Marı́n, Alfredo. (2006). Lower bounds for the two-stage uncapacitated facility location problem. European Journal of Operational Research. 179(3). 1126–1142. 24 indexed citations
17.
Fernández, Pascual & Alfredo Marı́n. (2003). A Heuristic Procedure For Path Location With Multisource Demand. INFOR Information Systems and Operational Research. 41(2). 165–177. 4 indexed citations
18.
Landete, Mercedes, et al.. (2002). On the facets of the simple plant location packing polytope. Discrete Applied Mathematics. 124(1-3). 27–53. 20 indexed citations
19.
Landete, Mercedes, et al.. (2000). New facets for the set packing polytope. Operations Research Letters. 27(4). 153–161. 23 indexed citations
20.
Marı́n, Alfredo & Blas Pelegrı́n. (1998). The return plant location problem: Modelling and resolution. European Journal of Operational Research. 104(2). 375–392. 66 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

Breakdown of academic impact, for papers by Barbaros Ç. Tansel Breakdown of academic impact, for papers by Masoud Hekmatfar Breakdown of academic impact, for papers by Ivan Contreras Breakdown of academic impact, for papers by John G. Klincewicz Breakdown of academic impact, for papers by Andreas Klose Breakdown of academic impact, for papers by Roberto D. Galvão Breakdown of academic impact, for papers by Jadranka Skorin‐Kapov Breakdown of academic impact, for papers by Oya Ekin Karaşan Breakdown of academic impact, for papers by Luce Brotcorne Breakdown of academic impact, for papers by Turgut Aykin
Rankless by CCL
2026