José M. Sanchis

1.3k total citations
50 papers, 906 citations indexed

About

José M. Sanchis is a scholar working on Industrial and Manufacturing Engineering, Building and Construction and Automotive Engineering. According to data from OpenAlex, José M. Sanchis has authored 50 papers receiving a total of 906 indexed citations (citations by other indexed papers that have themselves been cited), including 48 papers in Industrial and Manufacturing Engineering, 13 papers in Building and Construction and 11 papers in Automotive Engineering. Recurrent topics in José M. Sanchis's work include Vehicle Routing Optimization Methods (48 papers), Optimization and Packing Problems (22 papers) and Transportation and Mobility Innovations (11 papers). José M. Sanchis is often cited by papers focused on Vehicle Routing Optimization Methods (48 papers), Optimization and Packing Problems (22 papers) and Transportation and Mobility Innovations (11 papers). José M. Sanchis collaborates with scholars based in Spain, Italy and United States. José M. Sanchis's co-authors include Ángel Corberán, Isaac Plana, Enrique Benavent, James F. Campbell, Claudia Archetti, M. Grazia Speranza, Richard Eglese, David Soler, Geir Hasle and Adam N. Letchford and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Operations Research.

In The Last Decade

José M. Sanchis

48 papers receiving 864 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
José M. Sanchis Spain 20 785 229 216 152 105 50 906
Isaac Plana Spain 15 520 0.7× 151 0.7× 135 0.6× 112 0.7× 93 0.9× 36 638
Nicolas Jozefowiez France 14 705 0.9× 309 1.3× 214 1.0× 77 0.5× 46 0.4× 27 976
Claudio Sterle Italy 14 394 0.5× 122 0.5× 138 0.6× 93 0.6× 62 0.6× 54 599
Niklas Kohl Denmark 7 906 1.2× 399 1.7× 186 0.9× 47 0.3× 58 0.6× 8 1.1k
Nilson Herazo-Padilla Colombia 7 805 1.0× 449 2.0× 431 2.0× 70 0.5× 94 0.9× 12 1.0k
Pedro Munari Brazil 19 661 0.8× 240 1.0× 139 0.6× 137 0.9× 27 0.3× 54 882
İmdat Kara Türkiye 12 563 0.7× 221 1.0× 222 1.0× 108 0.7× 75 0.7× 27 686
J-F Cordeau Canada 8 1.3k 1.7× 619 2.7× 416 1.9× 74 0.5× 112 1.1× 9 1.5k
Michael Drexl Germany 16 1.2k 1.6× 633 2.8× 610 2.8× 193 1.3× 96 0.9× 23 1.4k
Puca Huachi Vaz Penna Brazil 11 707 0.9× 343 1.5× 221 1.0× 87 0.6× 128 1.2× 23 812

Countries citing papers authored by José M. Sanchis

Since Specialization
Citations

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

Fields of papers citing papers by José M. Sanchis

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of José M. Sanchis

This figure shows the co-authorship network connecting the top 25 collaborators of José M. Sanchis. A scholar is included among the top collaborators of José M. Sanchis 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 José M. Sanchis. José M. Sanchis 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.
Landete, Mercedes, et al.. (2025). A modified single-objective genetic algorithm for solving the rural postman problem with load-dependent costs. Knowledge-Based Systems. 312. 113146–113146. 1 indexed citations
2.
Plana, Isaac, et al.. (2024). The min max multi-trip drone location arc routing problem. Computers & Operations Research. 174. 106894–106894. 1 indexed citations
3.
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
4.
Campbell, James F., et al.. (2023). The multi‐purpose K‐drones general routing problem. Networks. 82(4). 437–458. 11 indexed citations
5.
Landete, Mercedes, et al.. (2023). Upgrading edges in the Graphical TSP. Computers & Operations Research. 159. 106321–106321. 2 indexed citations
6.
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.
7.
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
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, 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
10.
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
11.
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
12.
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
13.
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
14.
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
15.
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
16.
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
17.
Sanchis, José M.. (2005). "Millorar", un plan de futuro para la agricultura valenciana. Hispana. 18–21. 1 indexed citations
18.
Benavent, Enrique, et al.. (2005). Lower bounds and heuristics for the Windy Rural Postman Problem. European Journal of Operational Research. 176(2). 855–869. 31 indexed citations
19.
Corberán, Ángel, Enrique Mota, & José M. Sanchis. (2005). A comparison of two different formulations for arc routing problems on mixed graphs. Computers & Operations Research. 33(12). 3384–3402. 19 indexed citations
20.
Sanchis, José M., et al.. (2003). The mixed general routing polyhedron. Mathematical Programming. 96(1). 103–137. 25 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