Follow
Miguel Reula
Title
Cited by
Cited by
Year
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
152021
A matheuristic for the distance-constrained close-enough arc routing problem
Á Corberán, I Plana, M Reula, JM Sanchis
Top 27, 312-326, 2019
142019
The min-max close-enough arc routing problem
N Bianchessi, Á Corberán, I Plana, M Reula, JM Sanchis
European Journal of Operational Research 300 (3), 837-851, 2022
132022
Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities
MRH Maia, M Reula, C Parreño-Torres, PP Vuppuluri, A Plastino, ...
Soft Computing 27 (8), 4685-4698, 2023
92023
The profitable close-enough arc routing problem
N Bianchessi, Á Corberán, I Plana, M Reula, JM Sanchis
Computers & Operations Research 140, 105653, 2022
92022
Solving the Palliative Home Health Care Routing and Scheduling Problem with an integer linear programming model
C Parreño-Torres, M Reula, R Alvarez-Valdes, F Parreño
Expert Systems with Applications 249, 123728, 2024
12024
Heuristics for the profitable close-enough arc routing problem
M Reula, R Martí
Expert Systems With Applications 230, 120513, 2023
12023
VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem
M Reula, C Parreño-Torres, A Martínez-Gavara, R Martí
Metaheuristics International Conference, 103-109, 2024
2024
Heuristics for the Profitable Close-Enough Arc Routing Problem
M Reula Martín, R Martí Cunquero
Elsevier BV, 2023
2023
Comunidades de práctica predoctorales: Diez años del Seminari Predoc en la Facultat de Ciències Matemàtiques
G Calvo Bayarri, J Castillo-Medina, E Cosme Llópez, S Dantas, ...
Universitat Politècnica de València, 2022
2022
The Min-max close-enough arc routing problem
Á Coberán, I Plana, M Reula, JM Sanchis
Elsevier BV, 2022
2022
On the Distance-Constrained Close Enough Arc Routing Problem
Á Corberán Salvador, I Plana Andani, M Reula Martín, JM Sanchis Llopis
Elsevier, 2021
2021
Contributions to Close-Enough Arc Routing Problems
M Reula Martín
2021
Contributions to close-enough arc routing problems
MR Martín
Universitat de València, 2021
2021
Distance-Constrained Close Enough Arc Routing Problem: Polyhedral study and B&C algorithm
Á Corberán, I Plana, M Reula, JM Sanchis
X International Workshop on Locational Analysis and Related Problems, 43, 2020
2020
Feasible solutions for the Distance Constrained Close-Enough Arc Routing Problem
M Reula, Á Corberán, I Plana, JM Sanchis
Conference Map, 89, 0
The system can't perform the operation now. Try again later.
Articles 1–16