Publicaciones en las que colabora con FRANCISCO JAVIER RODRÍGUEZ DÍAZ (25)

2023

  1. Iterated Greedy

    Springer Optimization and Its Applications (Springer), pp. 107-133

2018

  1. Genetic algorithms

    Handbook of Heuristics (Springer International Publishing), pp. 431-464

2016

  1. A genetic algorithm for the minimum generating set problem

    Applied Soft Computing Journal, Vol. 48, pp. 254-264

  2. Randomized greedy multi-start algorithm for the minimum common integer partition problem

    Engineering Applications of Artificial Intelligence, Vol. 50, pp. 226-235

2015

  1. A two-stage constructive method for the unweighted minimum string cover problem

    Knowledge-Based Systems, Vol. 77, pp. 103-113

  2. The firefighter problem: Empirical results on random graphs

    Computers and Operations Research, Vol. 60, pp. 55-66

2014

  1. A new memetic algorithm for multi-document summarization based on CHC algorithm and greedy search

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8856, pp. 125-138

  2. Strategic oscillation for the quadratic multiple knapsack problem

    Computational Optimization and Applications, Vol. 58, Núm. 1, pp. 161-185

  3. Tabu search with strategic oscillation for the quadratic minimum spanning tree

    IIE Transactions (Institute of Industrial Engineers), Vol. 46, Núm. 4, pp. 414-428

  4. Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem

    European Journal of Operational Research, Vol. 232, Núm. 3, pp. 454-463

  5. The firefighter problem: Application of hybrid ant colony optimization algorithms

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

2012

  1. A simulated annealing method based on a specialised evolutionary algorithm

    Applied Soft Computing Journal, Vol. 12, Núm. 2, pp. 573-588

  2. An artificial bee colony algorithm for the unrelated parallel machines scheduling problem

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

  3. Arbitrary function optimisation with metaheuristics: No free lunch and real-world problems: No free lunch and real-world problems

    Soft Computing, Vol. 16, Núm. 12, pp. 2115-2133

  4. GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times

    Annals of Operations Research, Vol. 201, Núm. 1, pp. 383-401