| GRASP and path relinking for the matrix bandwidth minimization E Pinana, I Plana, V Campos, R Martı European Journal of Operational Research 153 (1), 200-210, 2004 | 138 | 2004 |
| 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 | 85 | 2021 |
| A branch & cut algorithm for the windy general routing problem and special cases A Corberán, I Plana, JM Sanchis Networks 49 (4), 245-257, 2007 | 75 | 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 |
| The team orienteering arc routing problem C Archetti, MG Speranza, Á Corberán, JM Sanchis, I Plana Transportation Science 48 (3), 442-457, 2014 | 65 | 2014 |
| Drone arc routing problems JF Campbell, Á Corberán, I Plana, JM Sanchis Networks 72 (4), 543-559, 2018 | 64 | 2018 |
| Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm A Arigliano, G Ghiani, A Grieco, E Guerriero, I Plana Discrete Applied Mathematics 261, 28-39, 2019 | 53 | 2019 |
| 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 |
| 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 | 46 | 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 | 39 | 2013 |
| 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 |
| Solving the length constrained K-drones rural postman problem JF Campbell, Á Corberán, I Plana, JM Sanchis, P Segura European Journal of Operational Research 292 (1), 60-72, 2021 | 34 | 2021 |
| 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 | 34 | 2016 |
| A branch-and-cut algorithm for the orienteering arc routing problem C Archetti, Á Corberán, I Plana, JM Sanchis, MG Speranza Computers & Operations Research 66, 95-104, 2016 | 32 | 2016 |
| New facets and an enhanced branch‐and‐cut for the min–max K‐vehicles windy rural postman problem E Benavent, A Corberán, I Plana, JM Sanchis Networks 58 (4), 255-272, 2011 | 27 | 2011 |
| New results on the windy postman problem A Corberán, M Oswald, I Plana, G Reinelt, JM Sanchis Mathematical Programming 132, 309-332, 2012 | 22 | 2012 |
| The stacker crane problem and the directed general routing problem T Avila, A Corberán, I Plana, JM Sanchis Networks 65 (1), 43-55, 2015 | 20 | 2015 |
| Arc routing problems: data instances Á Corberán, I Plana, JM Sanchis | 18 | 2007 |
| Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem T Ávila, Á Corberán, I Plana, JM Sanchis EURO Journal on Computational Optimization 5 (3), 339-365, 2017 | 16 | 2017 |
| On the distance-constrained close enough arc routing problem Á Corberán, I Plana, M Reula, JM Sanchis European Journal of Operational Research 291 (1), 32-51, 2021 | 15 | 2021 |
