Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. - Sandro Pirkwieser; Günther R. Raidl; Jakob Puchinger (EvoCOP, 2007)

Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. - Sandro Pirkwieser; Günther R. Raidl (GECCO, 2008)

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. - Sandro Pirkwieser; Günther R. Raidl; Jakob Puchinger (Recent Advances in Evolutionary Computation for Combinatorial Optimization, 2008)

Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows. - Sandro Pirkwieser; Günther R. Raidl (Hybrid Metaheuristics, 2009)

Multilevel Variable Neighborhood Search for Periodic Routing Problems. - Sandro Pirkwieser; Günther R. Raidl (EvoCOP, 2010)

Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem. - Sandro Pirkwieser; Günther R. Raidl (Hybrid Metaheuristics, 2010)

MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics. - Jakob Puchinger; Günther R. Raidl; Sandro Pirkwieser (Matheuristics, 2010)

Solving the Two-Dimensional Bin-Packing Problem with Variable Bin Sizes by Greedy Randomized Adaptive Search Procedures and Variable Neighborhood Search. - Andreas M. Chwatal; Sandro Pirkwieser (EUROCAST (1), 2011)

Improved Packing and Routing of Vehicles with Compartments. - Sandro Pirkwieser; Günther R. Raidl; Jens Gottlieb (EUROCAST (1), 2011)

A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem. - Martin Schwengerer; Sandro Pirkwieser; Günther R. Raidl (EvoCOP, 2012)