1

Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification

Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Part II, volume 3562 of LNCS, pages 41–53, 2005, Springer.

Jakob Puchinger, Günther Raidl

Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search

Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005.

Bin Hu, Markus Leitner, Günther Raidl

Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem

Proceedings of MIC2005, the 6th Metaheuristics International Conference, pages 775–780, 2005.

Jakob Puchinger, Günther Raidl, Martin Gruber

Relaxation Guided Variable Neighborhood Search

Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005.

Jakob Puchinger, Günther Raidl

Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem

Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005.

Martin Gruber, Günther Raidl

An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing

Parallel Problem Solving from Nature – PPSN~VIII (X. Yao et. al, ed.), volume 3242 of LNCS, pages 642–651, 2004, Springer.

Jakob Puchinger, Günther Raidl

An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem

Parallel Problem Solving from Nature – PPSN~VIII (Xin Yao, others, eds.), volume 3242 of LNCS, pages 302–311, 2004, Springer-Verlag.

Gabriele Koller, Günther Raidl

An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem

Proceedings of the 2003 ACM Symposium on Applied Computing (H. M. Haddadd, others, eds.), pages 990–995, 2004, ACM Press.

Günther Raidl, H. Feltl

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem

Genetic and Evolutionary Computation – GECCO 2004 (K.~ Deb, others, eds.), volume 3102 of LNCS, pages 1304–1315, 2004, Springer.

G.W.~Klau, I.~Ljubić, A.~Moser, P.~Mutzel, P.~Neuner, U.~Pferschy, G.~Raidl, R.~Weiskircher

Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable

SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings, 2004.

Shlomo Hoory, Stefan Szeider