• Construct, Merge, Solve and Adapt: Application to the repetition-free longest common subsequence problem 

    Blum, Christian; Blesa Aguilera, Maria Josep (2016-03)
    Article
    Accés obert
    In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetition-free longest common subsequence problem. The applied algorithm, which is labelled Construct, ...
  • Large neighborhood search for the most strings with few bad columns problem 

    Lizárraga Olivas, Evelia; Blesa Aguilera, Maria Josep; Blum, Christian; Raidl, Günther (Springer, 2016-10-06)
    Article
    Accés obert
    In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings ...
  • Metaheuristics for the edge-weighted K-cardinality tree problem 

    Blum, Christian; Blesa Aguilera, Maria Josep (2003-01)
    Report de recerca
    Accés obert
    Metaheuristics are successful algorithmic concepts to tackle extit{NP}-hard combinatorial optimization problems. In this paper we deal with metaheuristics for the K-cardinality tree (KCT) problem in edge-weighted graphs. ...