Argitalpenak (10) MIGUEL REULA MARTIN argitalpenak

2024

  1. Solving the Palliative Home Health Care Routing and Scheduling Problem with an integer linear programming model

    Expert Systems with Applications, Vol. 249

  2. VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2023

  1. Heuristics for the Profitable Close-Enough Arc Routing Problem

    Expert Systems with Applications, Vol. 230

  2. Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities

    Soft Computing, Vol. 27, Núm. 8, pp. 4685-4698

2022

  1. Comunidades de práctica predoctorales: Diez años del Seminari Predoc en la Facultat de Ciències Matemàtiques

    In-Red 2022. VIII Congreso nacional de innovación educativa y docencia en red

  2. Contributions to Close-Enough Arc Routing Problems

    BEIO, Boletín de Estadística e Investigación Operativa, Vol. 38, Núm. 3

  3. The Profitable Close-Enough Arc Routing Problem

    Computers and Operations Research, Vol. 140

  4. The min-max close-enough arc routing problem

    European Journal of Operational Research, Vol. 300, Núm. 3, pp. 837-851

2021

  1. On the Distance-Constrained Close Enough Arc Routing Problem

    European Journal of Operational Research, Vol. 291, Núm. 1, pp. 32-51

2019

  1. A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem

    Top, Vol. 27, Núm. 2, pp. 312-326