| A polyhedral approach to the rural postman problem A Corberán, JM Sanchis European Journal of Operational Research 79 (1), 95-114, 1994 | 144 | 1994 |
| Arc routing problems: A review of the past, present, and future A Corberán, R Eglese, G Hasle, I Plana, JM Sanchis Networks 77 (1), 88-115, 2021 | 95 | 2021 |
| An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation J Albiach, JM Sanchis, D Soler European Journal of Operational Research 189 (3), 789-802, 2008 | 87 | 2008 |
| A cutting plane algorithm for the general routing problem A Corberáan, AN Letchford, JM Sanchis Mathematical programming 90, 291-316, 2001 | 83 | 2001 |
| A branch & cut algorithm for the windy general routing problem and special cases A Corberán, I Plana, JM Sanchis Networks: An International Journal 49 (4), 245-257, 2007 | 74 | 2007 |
| Min‐Max K‐vehicles windy rural postman problem E Benavent, A Corberán, I Plana, JM Sanchis Networks: An International Journal 54 (4), 216-226, 2009 | 67 | 2009 |
| A GRASP heuristic for the mixed Chinese postman problem A Corberán, R Martı, JM Sanchis European Journal of Operational Research 142 (1), 70-80, 2002 | 67 | 2002 |
| The team orienteering arc routing problem C Archetti, MG Speranza, Á Corberán, JM Sanchis, I Plana Transportation Science 48 (3), 442-457, 2014 | 66 | 2014 |
| Drone arc routing problems JF Campbell, Á Corberán, I Plana, JM Sanchis Networks 72 (4), 543-559, 2018 | 65 | 2018 |
| The mixed general routing polyhedron A Corberán, A Romero, JM Sanchis Mathematical Programming 96, 103-137, 2003 | 57* | 2003 |
| The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra A Corberán, JM Sanchis European Journal of Operational Research 108 (3), 538-550, 1998 | 56 | 1998 |
| Lower bounds and heuristics for the windy rural postman problem E Benavent, A Carrotta, A Corberán, JM Sanchis, D Vigo European journal of operational research 176 (2), 855-869, 2007 | 55 | 2007 |
| New results on the mixed general routing problem A Corberán, G Mejía, JM Sanchis Operations Research 53 (2), 363-376, 2005 | 54 | 2005 |
| A matheuristic for the team orienteering arc routing problem C Archetti, Á Corberán, I Plana, JM Sanchis, MG Speranza European Journal of Operational Research 245 (2), 392-401, 2015 | 51 | 2015 |
| Linear programming based methods for solving arc routing problems E Benavent, A Corberán, JM Sanchis Arc routing: Theory, solutions and applications, 231-275, 2000 | 46 | 2000 |
| New heuristic algorithms for the windy rural postman problem E Benavent, A Corberán, E Piñana, I Plana, JM Sanchis Computers & operations research 32 (12), 3111-3128, 2005 | 45 | 2005 |
| A branch-and-cut algorithm for the maximum benefit Chinese postman problem Á Corberán, I Plana, AM Rodríguez-Chía, JM Sanchis Mathematical Programming 141, 21-48, 2013 | 41 | 2013 |
| A heuristic algorithm based on Monte Carlo methods for the rural postman problem PF De Córdoba, LMG Raffi, JM Sanchis Computers & operations research 25 (12), 1097-1106, 1998 | 41 | 1998 |
| A new branch-and-cut algorithm for the generalized directed rural postman problem T Avila, Á Corberán, I Plana, JM Sanchis Transportation Science 50 (2), 750-761, 2016 | 37 | 2016 |
| The windy general routing polyhedron: A global view of many known arc routing polyhedra A Corberán, I Plana, JM Sanchis SIAM Journal on Discrete Mathematics 22 (2), 606-628, 2008 | 37 | 2008 |
