Universidad Rey Juan Carlos-ko ikertzaileekin lankidetzan egindako argitalpenak (19)

2025

  1. A variable neighborhood search for the median location problem with interconnected facilities

    International Transactions in Operational Research, Vol. 32, Núm. 1, pp. 69-89

  2. The multiobjective traveling salesman–repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario

    International Transactions in Operational Research, Vol. 32, Núm. 1, pp. 221-243

2023

  1. A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs

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

  2. A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem

    Soft Computing, Vol. 27, Núm. 12, pp. 8029-8059

  3. An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem

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

  4. An iterated greedy algorithm for finding the minimum dominating set in graphs

    Mathematics and Computers in Simulation, Vol. 207, pp. 41-58

2022

  1. A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem

    Optimization Letters, Vol. 16, Núm. 1, pp. 301-331

  2. GRASP with strategic oscillation for the α-neighbor p-center problem

    European Journal of Operational Research, Vol. 303, Núm. 1, pp. 143-158

2021

  1. A hybrid strategic oscillation with path relinking algorithm for the multiobjective k-balanced center location problem

    Mathematics, Vol. 9, Núm. 8

  2. A new scatter search design for multiobjective combinatorial optimization with an application to facility location

    INFORMS Journal on Computing, Vol. 33, Núm. 2, pp. 629-642

  3. An efficient algorithm for crowd logistics optimization

    Mathematics, Vol. 9, Núm. 5, pp. 1-19

  4. Cuando el más cercano no es el preferible

    R-evolucionando el transporte [Recurso electrónico]: XIV Congreso de Ingeniería del Transporte. Universidad de Burgos 6, 7 y 8 de julio 2021

  5. Localización bajo dos perspectivas enfrentadas: ¿cercanías o Reparto Justo?

    R-evolucionando el transporte [Recurso electrónico]: XIV Congreso de Ingeniería del Transporte. Universidad de Burgos 6, 7 y 8 de julio 2021

2020

  1. A general variable neighborhood search for solving the multi-objective open vehicle routing problem

    Journal of Heuristics, Vol. 26, Núm. 3, pp. 423-452

  2. Preface to the special issue on optimization in vehicle routing and logistics

    Networks

2019

  1. A multi-objective parallel iterated greedy for solving the p-center and p-dispersion problem

    Electronics (Switzerland), Vol. 8, Núm. 12

  2. GRASP and VNS for solving the p-next center problem

    Computers and Operations Research, Vol. 104, pp. 295-303

  3. How to Locate Disperse Obnoxious Facility Centers?

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

2018

  1. A multiobjective GRASP–VND algorithm to solve the waste collection problem

    International Transactions in Operational Research, Vol. 25, Núm. 2, pp. 545-567