Publicaciones en colaboración con investigadoras/es de Universitat Politècnica de Catalunya (30)

2021

  1. On the geometry of the set of control matrices of linear systems with prescribed controllability indices

    Linear Algebra and Its Applications, Vol. 624, pp. 214-246

  2. Regularity of the Kronecker stratification of realisable Markov parameters

    International Journal of Control, Vol. 94, Núm. 1, pp. 30-38

2019

  1. Versal deformation of realisable Markov parameters

    International Journal of Control, Vol. 92, Núm. 8, pp. 1846-1857

2017

  1. A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem

    2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)

  2. A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem

    2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings

  3. Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: Which one works better when?

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

  4. Large neighborhood search for the most strings with few bad columns problem

    Soft Computing, Vol. 21, Núm. 17, pp. 4901-4915

  5. On the geometry of realizable Markov parameters by SIMO and MISO systems

    Linear Algebra and Its Applications, Vol. 518, pp. 97-143

2016

  1. Ant colony optimization

    Intelligent Systems (CRC Press)

  2. Construct, merge, solve and adapt: Application to the repetition-free longest common subsequence problem

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

  3. Preface

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

2015

  1. Ant Colony Optimization for the Minimum-Weight Rooted Arborescence Problem

    SPRINGER HANDBOOK OF COMPUTATIONAL INTELLIGENCE (SPRINGER-VERLAG BERLIN), pp. 1333-1343

  2. Ant colony optimization for the minimum-weight rooted arborescence problem

    Springer Handbook of Computational Intelligence (Springer Berlin Heidelberg), pp. 1333-1343

  3. FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs

    Swarm Intelligence, Vol. 9, Núm. 2-3, pp. 205-227

  4. On Solving The Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics

    2015 INTERNATIONAL SYMPOSIUM ON INNOVATIONS IN INTELLIGENT SYSTEMS AND APPLICATIONS (INISTA) PROCEEDINGS

  5. On solving the most strings with few bad columns problem: An ILP model and heuristics

    INISTA 2015 - 2015 International Symposium on Innovations in Intelligent SysTems and Applications, Proceedings

2014

  1. Beam-ACO for the repetition-free longest common subsequence problem

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

  2. Can frogs find large independent sets in a decentralized way? Yes they can!

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8667, pp. 74-85

  3. 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)

2013

  1. Application of large neighborhood search to strategic supply chain management in the chemical industry

    Studies in Computational Intelligence, Vol. 434, pp. 335-352