Ikerbasque, Fundación Vasca para la Ciencia-ko ikertzaileekin lankidetzan egindako argitalpenak (25)

2016

  1. A hybrid algorithmic model for the minimum weight dominating set problem

    Simulation Modelling Practice and Theory, Vol. 64, pp. 57-68

  2. Computational performance evaluation of two integer linear programming models for the minimum common string partition problem

    Optimization Letters, Vol. 10, Núm. 1, pp. 189-205

  3. Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization

    Computers and Operations Research, Vol. 68, pp. 75-88

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

  5. Construct, merge, solve and adapt: Application to unbalanced minimum common string partition

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

  6. The workshops at PPSN 2016

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

2015

  1. A matheuristic for the minimum weight rooted arborescence problem

    Journal of Heuristics, Vol. 21, Núm. 4, pp. 479-499

  2. A randomized population-based iterated greedy algorithm for the minimum weight dominating set problem

    2015 6TH INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION SYSTEMS (ICICS)

  3. A randomized population-based iterated greedy algorithm for the minimum weight dominating set problem

    2015 6th International Conference on Information and Communication Systems, ICICS 2015

  4. An artificial bioindicator system for network intrusion detection

    Artificial Life, Vol. 21, Núm. 2, pp. 93-118

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

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

  6. Mathematical programming strategies for solving the minimum common string partition problem

    European Journal of Operational Research, Vol. 242, Núm. 3, pp. 769-777

  7. The firefighter problem: Empirical results on random graphs

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

2014

  1. A hybrid ant colony optimization algorithm for the far from most string problem

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

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

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

  4. FrogSim: Distributed graph coloring in wireless ad hoc networks: An algorithm inspired by the calling behavior of Japanese tree frogs

    Telecommunication Systems

  5. Iterative probabilistic tree search for the minimum common string partition problem

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

  6. Learning maximum weighted (k+1)-order decomposable graphs by integer linear programming

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8754, pp. 396-408

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