Isaac Plana

878 total citations
36 papers, 638 citations indexed

About

Isaac Plana is a scholar working on Industrial and Manufacturing Engineering, Building and Construction and Automotive Engineering. According to data from OpenAlex, Isaac Plana has authored 36 papers receiving a total of 638 indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Industrial and Manufacturing Engineering, 10 papers in Building and Construction and 9 papers in Automotive Engineering. Recurrent topics in Isaac Plana's work include Vehicle Routing Optimization Methods (35 papers), Optimization and Packing Problems (14 papers) and Facility Location and Emergency Management (9 papers). Isaac Plana is often cited by papers focused on Vehicle Routing Optimization Methods (35 papers), Optimization and Packing Problems (14 papers) and Facility Location and Emergency Management (9 papers). Isaac Plana collaborates with scholars based in Spain, Italy and United States. Isaac Plana's co-authors include José M. Sanchis, Ángel Corberán, James F. Campbell, Vicente Campos, Rafael Martı́, Enrique Benavent, Claudia Archetti, M. Grazia Speranza, Geir Hasle and Richard Eglese and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Mathematical Programming.

In The Last Decade

Isaac Plana

35 papers receiving 615 citations

Peers

Isaac Plana
Isaac Plana
Citations per year, relative to Isaac Plana Isaac Plana (= 1×) peers Claudio Sterle

Countries citing papers authored by Isaac Plana

Since Specialization
Citations

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

Fields of papers citing papers by Isaac Plana

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Isaac Plana

This figure shows the co-authorship network connecting the top 25 collaborators of Isaac Plana. A scholar is included among the top collaborators of Isaac Plana 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 Isaac Plana. Isaac Plana 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.
Plana, Isaac, et al.. (2024). The min max multi-trip drone location arc routing problem. Computers & Operations Research. 174. 106894–106894. 1 indexed citations
2.
Plana, Isaac, et al.. (2024). The multidepot drone general routing problem with duration and capacity constraints. International Transactions in Operational Research. 32(6). 3756–3779. 6 indexed citations
3.
Campbell, James F., et al.. (2023). The multi‐purpose K‐drones general routing problem. Networks. 82(4). 437–458. 11 indexed citations
4.
Landete, Mercedes, et al.. (2023). Upgrading edges in the Graphical TSP. Computers & Operations Research. 159. 106321–106321. 2 indexed citations
5.
Corberán, Ángel, et al.. (2023). Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem. Computers & Operations Research. 162. 106482–106482.
6.
Bianchessi, Nicola, et al.. (2021). The min-max close-enough arc routing problem. European Journal of Operational Research. 300(3). 837–851. 5 indexed citations
7.
Corberán, Ángel, Richard Eglese, Geir Hasle, Isaac Plana, & José M. Sanchis. (2020). Arc routing problems: A review of the past, present, and future. Networks. 77(1). 88–115. 65 indexed citations
8.
Campbell, James F., et al.. (2020). Solving the length constrained K-drones rural postman problem. European Journal of Operational Research. 292(1). 60–72. 34 indexed citations
9.
Corberán, Ángel, et al.. (2020). On the Distance-Constrained Close Enough Arc Routing Problem. European Journal of Operational Research. 291(1). 32–51. 11 indexed citations
10.
Ghiani, Gianpaolo, et al.. (2018). Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm. Discrete Applied Mathematics. 261. 28–39. 32 indexed citations
11.
Corberán, Ángel, Güneş Erdoğan, Gilbert Laporte, Isaac Plana, & José M. Sanchis. (2018). The Chinese Postman Problem with Load-Dependent Costs. Transportation Science. 52(2). 370–385. 5 indexed citations
12.
Campbell, James F., Ángel Corberán, Isaac Plana, & José M. Sanchis. (2018). Drone arc routing problems. Networks. 72(4). 543–559. 50 indexed citations
13.
Archetti, Claudia, Ángel Corberán, Isaac Plana, José M. Sanchis, & M. Grazia Speranza. (2015). A branch-and-cut algorithm for the Orienteering Arc Routing Problem. Computers & Operations Research. 66. 95–104. 20 indexed citations
14.
Corberán, Ángel, et al.. (2015). Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. SHILAP Revista de lepidopterología. 5(3). 339–365. 10 indexed citations
15.
Archetti, Claudia, M. Grazia Speranza, Ángel Corberán, José M. Sanchis, & Isaac Plana. (2013). The Team Orienteering Arc Routing Problem. Transportation Science. 48(3). 442–457. 39 indexed citations
16.
Benavent, Enrique, Ángel Corberán, Isaac Plana, & José M. Sanchis. (2011). New facets and an enhanced branch‐and‐cut for the min–max K‐vehicles windy rural postman problem. Networks. 58(4). 255–272. 16 indexed citations
17.
Corberán, Ángel, Marcus Oswald, Isaac Plana, Gerhard Reinelt, & José M. Sanchis. (2010). New results on the Windy Postman Problem. Mathematical Programming. 132(1-2). 309–332. 6 indexed citations
18.
Benavent, Enrique, Ángel Corberán, Isaac Plana, & José M. Sanchis. (2009). Min‐Max K‐vehicles windy rural postman problem. Networks. 54(4). 216–226. 27 indexed citations
19.
Corberán, Ángel, Isaac Plana, & José M. Sanchis. (2007). A branch & cut algorithm for the windy general routing problem and special cases. Networks. 49(4). 245–257. 44 indexed citations
20.
Corberán, Ángel, Isaac Plana, & José M. Sanchis. (2006). Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems. Mathematical Programming. 108(1). 79–96. 4 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