Now showing items 1-4 of 4

  • A brief survey on hybrid metaheuristics 

    Blum, Christian; Puchinger, Jakob; Raidl, Günther; Roli, Andrea (2010)
    Conference report
    Restricted access - publisher's policy
    The combination of components from different algorithms is currently one of most successful trends in optimization. The hybridization of metaheuristics, such as ant colony optimization, evolutionary algorithms, and variable ...
  • Hybrid metaheuristics in combinatorial optimization: A survey 

    Blum, Christian; Puchinger, Jakob; Raidl, Günther; Roli, Andrea (2011-09)
    Article
    Restricted access - publisher's policy
    Research in metaheuristics for combinatorial optimization problems has lately experienced a noteworthy shift towards the hybridization of metaheuristics with other techniques for optimization. At the same time, the focus ...
  • 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
    Open Access
    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 ...
  • On solving the most strings with few bad columns problem: An ILP model and heuristics 

    Lizárraga Olivas, Evelia; Blesa Aguilera, Maria Josep; Blum, Christian; Raidl, Günther (Institute of Electrical and Electronics Engineers (IEEE), 2015)
    Conference lecture
    Open Access
    The most strings with few bad columns problem is an NP-hard combinatorial optimization problem from the bioinformatics field. This paper presents the first integer linear programming model for this problem. Moreover, a ...