Publicaciones en las que colabora con Christian Blum (12)

2018

  1. Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models

    Proceedings of Machine Learning Research

  2. The weighted independent domination problem: Integer linear programming models and metaheuristic approaches

    European Journal of Operational Research, Vol. 265, Núm. 3, pp. 860-871

2017

  1. The weighted independent domination problem: ILP model and algorithmic approaches

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

2016

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

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

2015

  1. A matheuristic for the minimum weight rooted arborescence problem

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

  2. An artificial bioindicator system for network intrusion detection

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

  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. Mathematical programming strategies for solving the minimum common string partition problem

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

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

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