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 |

A matheuristic for the distance-constrained close-enough arc routing problem Á Corberán, I Plana, M Reula, JM Sanchis Top 27, 312-326, 2019 | 13 | 2019 |

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 | 11 | 2022 |

The profitable close-enough arc routing problem N Bianchessi, Á Corberán, I Plana, M Reula, JM Sanchis Computers & Operations Research 140, 105653, 2022 | 8 | 2022 |

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 | 5 | 2023 |

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 | | 2024 |

Heuristics for the Profitable Close-Enough Arc Routing Problem M Reula, R Martí Expert Systems with Applications 230, 120513, 2023 | | 2023 |

The Min-max close-enough arc routing problem Á Coberán, I Plana, M Reula, JM Sanchis Elsevier BV, 2022 | | 2022 |

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 | | |