Isaac Plana
Título
Citado por
Citado por
Año
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
1262004
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
582009
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
562007
The team orienteering arc routing problem
C Archetti, MG Speranza, Á Corberán, JM Sanchis, I Plana
Transportation Science 48 (3), 442-457, 2014
452014
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
402005
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
382015
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
342008
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
29*2019
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
252011
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 (1), 21-48, 2013
232013
New results on the windy postman problem
A Corberán, M Oswald, I Plana, G Reinelt, JM Sanchis
Mathematical programming 132 (1), 309-332, 2012
232012
A new branch-and-cut algorithm for the generalized directed rural postman problem
T Avila, A Corberán, I Plana, JM Sanchis
Transportation Science 50 (2), 750-761, 2016
222016
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
202016
Drone arc routing problems
JF Campbell, Á Corberán, I Plana, JM Sanchis
Networks 72 (4), 543-559, 2018
192018
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
152015
Arc routing problems: data instances
Á Corberán, I Plana, JM Sanchis
142007
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems
A Corberán, I Plana, JM Sanchis
Mathematical programming 108 (1), 79-96, 2006
132006
A branch‐price‐and‐cut algorithm for the min‐max k‐vehicle windy rural postman problem
E Benavent, Á Corberán, G Desaulniers, F Lessard, I Plana, JM Sanchis
Networks 63 (1), 34-45, 2014
122014
The rural postman problem on directed, mixed, and windy graphs
Á Corberán, I Plana, JM Sanchis
Arc Routing: Problems, Methods, and Applications; MOS-SIAM Series on …, 2014
112014
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
92017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20