Exploració per autor "Raidl, Günther"
Ara es mostren els items 1-4 de 4
-
A brief survey on hybrid metaheuristics
Blum, Christian; Puchinger, Jakob; Raidl, Günther; Roli, Andrea (2010)
Text en actes de congrés
Accés restringit per política de l'editorialThe 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
Accés restringit per política de l'editorialResearch 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
Accés obertIn 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)
Comunicació de congrés
Accés obertThe 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 ...