MALLBA: A library of skeletons for combinatorial optimisation E Alba, F Almeida, M Blesa, J Cabeza, C Cotta, M Díaz, I Dorta, J Gabarró, ... European Conference on Parallel Processing, 927-932, 2002 | 225 | 2002 |
New metaheuristic approaches for the edge-weighted k-cardinality tree problem C Blum, MJ Blesa Computers & Operations Research 32 (6), 1355-1377, 2005 | 103 | 2005 |
An ant colony optimization algorithm for DNA sequencing by hybridization C Blum, MY Vallès, MJ Blesa Computers & Operations Research 35 (11), 3620-3635, 2008 | 102 | 2008 |
Efficient parallel LAN/WAN algorithms for optimization. The MALLBA project E Alba, F Almeida, M Blesa, C Cotta, M Díaz, I Dorta, J Gabarró, C León, ... Parallel Computing 32 (5-6), 415-440, 2006 | 99 | 2006 |
Beam search for the longest common subsequence problem C Blum, MJ Blesa, M Lopez-Ibanez Computers & Operations Research 36 (12), 3178-3186, 2009 | 76 | 2009 |
A characterization of universal stability in the adversarial queuing model C Àlvarez, M Blesa, M Serna SIAM Journal on Computing 34 (1), 41-66, 2004 | 57 | 2004 |
Ant colony optimization for the maximum edge-disjoint paths problem M Blesa, C Blum Workshops on Applications of Evolutionary Computation, 160-169, 2004 | 44 | 2004 |
Hybrid metaheuristics C Blum, J Puchinger, G Raidl, A Roli Hybrid optimization: The ten years of CPAIOR, 305-335, 2011 | 39 | 2011 |
Adversarial models for priority‐based networks C Àlvarez, M Blesa, J Díaz, M Serna, A Fernández Networks: An International Journal 45 (1), 23-35, 2005 | 32 | 2005 |
Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem C Blum, MJ Blesa Evolutionary Computation in Combinatorial Optimization: 16th European …, 2016 | 31 | 2016 |
The firefighter problem: application of hybrid ant colony optimization algorithms C Blum, MJ Blesa, C García-Martínez, FJ Rodríguez, M Lozano Evolutionary Computation in Combinatorial Optimisation: 14th European …, 2014 | 31 | 2014 |
Probabilistic beam search for the longest common subsequence problem C Blum, MJ Blesa International Workshop on Engineering Stochastic Local Search Algorithms …, 2007 | 29 | 2007 |
A memetic algorithm for the minimum weighted k-cardinality tree subgraph problem MJ Blesa, P Moscato, F Xhafa Metaheuristic International Conference 1, 85-91, 2001 | 29 | 2001 |
Parallel skeletons for tabu search method MJ Blesa, L Hernandez, F Xhafa Proceedings. Eighth International Conference on Parallel and Distributed …, 2001 | 27 | 2001 |
A C++ Implementation of Tabu Search for k− Cardinality Tree Problem Based on Generic Programming and Component Reuse MJ Blesa, F Xhafa YOUNG RESEARCHERS WORKSHOP, 2000 | 25 | 2000 |
Universal stability of undirected graphs in the adversarial queueing model C Àlvarez, M Blesa, M Serna Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002 | 24 | 2002 |
Adversarial queueing model for continuous network dynamics M Blesa, D Calzada, A Fernández, L López, AL Martínez, A Santos, ... Theory of Computing Systems 44 (3), 304-331, 2009 | 22 | 2009 |
Finding edge-disjoint paths in networks: An ant colony optimization algorithm MJ Blesa, C Blum Journal of Mathematical Modelling and Algorithms 6, 361-391, 2007 | 18 | 2007 |
The impact of failure management on the stability of communication networks C Àlvarez, M Blesa, M Serna Proceedings. Tenth International Conference on Parallel and Distributed …, 2004 | 18 | 2004 |
The complexity of deciding stability under FFS in the Adversarial Queueing model C Àlvarez, M Blesa, J Dıaz, A Fernández, M Serna Information Processing Letters 90 (5), 261-266, 2004 | 18 | 2004 |