Hybrid metaheuristics in combinatorial optimization: A survey C Blum, J Puchinger, GR Raidl, A Roli Applied soft computing 11 (6), 4135-4151, 2011 | 970 | 2011 |

Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification J Puchinger, GR Raidl International work-conference on the interplay between natural and …, 2005 | 507 | 2005 |

A unified view on hybrid metaheuristics GR Raidl International workshop on hybrid metaheuristics, 1-12, 2006 | 449 | 2006 |

Edge sets: an effective evolutionary coding of spanning trees GR Raidl, BA Julstrom IEEE Transactions on evolutionary computation 7 (3), 225-239, 2003 | 388 | 2003 |

The multidimensional knapsack problem: Structure and algorithms J Puchinger, GR Raidl, U Pferschy INFORMS Journal on Computing 22 (2), 250-265, 2010 | 247 | 2010 |

Metaheuristics for solving a multimodal home-healthcare scheduling problem G Hiermann, M Prandtstetter, A Rendl, J Puchinger, GR Raidl Central European Journal of Operations Research 23, 89-113, 2015 | 236 | 2015 |

CyMATE: a new tool for methylation analysis of plant genomic DNA after bisulphite sequencing J Hetzl, AM Foerster, G Raidl, OM Scheid The Plant Journal 51 (3), 526-536, 2007 | 216 | 2007 |

Balancing bicycle sharing systems: A variable neighborhood search approach M Rainer-Harbach, P Papazek, B Hu, GR Raidl Evolutionary Computation in Combinatorial Optimization: 13th European …, 2013 | 184 | 2013 |

Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization GR Raidl, J Puchinger Hybrid metaheuristics: An emerging approach to optimization, 31-62, 2008 | 177 | 2008 |

Models and algorithms for three-stage two-dimensional bin packing J Puchinger, GR Raidl European Journal of Operational Research 183 (3), 1304-1327, 2007 | 175 | 2007 |

An improved genetic algorithm for the multiconstrained 0-1 knapsack problem GR Raidl 1998 IEEE International Conference on Evolutionary Computation Proceedings …, 1998 | 175 | 1998 |

Prüfer numbers: A poor representation of spanning trees for evolutionary search J Gottlieb, BA Julstrom, GR Raidl, F Rothlauf Proceedings of the genetic and evolutionary computation conference, 343-350, 2001 | 168 | 2001 |

An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem GR Raidl Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No …, 2000 | 154 | 2000 |

Balancing bicycle sharing systems: an approach for the dynamic case C Kloimüllner, P Papazek, B Hu, GR Raidl Evolutionary Computation in Combinatorial Optimisation: 14th European …, 2014 | 149 | 2014 |

An improved hybrid genetic algorithm for the generalized assignment problem H Feltl, GR Raidl Proceedings of the 2004 ACM symposium on Applied computing, 990-995, 2004 | 147 | 2004 |

Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem GR Raidl, BA Julstrom Proceedings of the 2003 ACM symposium on applied computing, 747-752, 2003 | 129 | 2003 |

Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem GR Raidl, J Gottlieb Evolutionary computation 13 (4), 441-475, 2005 | 128 | 2005 |

A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem GR Raidl, BA Julstrom Proceedings of the 2000 ACM symposium on Applied computing-Volume 1, 440-445, 2000 | 125 | 2000 |

An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem M Prandtstetter, GR Raidl European Journal of Operational Research 191 (3), 1004-1022, 2008 | 124 | 2008 |

Solving the post enrolment course timetabling problem by ant colony optimization C Nothegger, A Mayer, A Chwatal, GR Raidl Annals of Operations Research 194, 325-339, 2012 | 120 | 2012 |