On the Distance-Constrained Close Enough Arc Routing Problem. - Ángel Corberán; Isaac Plana; Miguel Reula; José M. Sanchis (Eur. J. Oper. Res., 2021)

The Profitable Close-Enough Arc Routing Problem. - Nicola Bianchessi; Ángel Corberán; Isaac Plana; Miguel Reula; José M. Sanchis (Comput. Oper. Res., 2022)

The min-max close-enough arc routing problem. - Nicola Bianchessi; Ángel Corberán; Isaac Plana; Miguel Reula; José M. Sanchis (Eur. J. Oper. Res., 2022)

Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities. - Marcelo Rodrigues de Holanda Maia; Miguel Reula; Consuelo Parreño-Torres; Prem Prakash Vuppuluri; Alexandre Plastino 001; Uéverton S. Souza; Sara Ceschia; Mario Pavone; Andrea Schaerf (Soft Comput., 2023)

Heuristics for the Profitable Close-Enough Arc Routing Problem. - Miguel Reula; Rafael Martí (Expert Syst. Appl., 2023)

VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem. - Miguel Reula; Consuelo Parreño-Torres; Anna Martínez-Gavara; Rafael Martí (MIC (1), 2024)

Solving the Palliative Home Health Care Routing and Scheduling Problem with an integer linear programming model. - Consuelo Parreño-Torres; Miguel Reula; Ramón Alvarez-Valdés; Francisco Parreño (Expert Syst. Appl., 2024)