dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Günther R. Raidl (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Schwengerer, Sandro Pirkwieser, Günther R. Raidl: A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem. EvoCOP 2012: 13-24
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSandro Pirkwieser, Günther R. Raidl, Jens Gottlieb: Improved Packing and Routing of Vehicles with Compartments. EUROCAST (1) 2011: 392-399
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSandro Pirkwieser, Günther R. Raidl: Multilevel Variable Neighborhood Search for Periodic Routing Problems. EvoCOP 2010: 226-238
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSandro Pirkwieser, Günther R. Raidl: Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem. Hybrid Metaheuristics 2010: 174-189
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJakob Puchinger, Günther R. Raidl, Sandro Pirkwieser: MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics. Matheuristics 2010: 71-102
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSandro Pirkwieser, Günther R. Raidl: Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows. Hybrid Metaheuristics 2009: 45-59
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSandro Pirkwieser, Günther R. Raidl: Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. GECCO 2008: 323-330
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSandro Pirkwieser, Günther R. Raidl, Jakob Puchinger: A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 69-85
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSandro Pirkwieser, Günther R. Raidl, Jakob Puchinger: Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. EvoCOP 2007: 176-187

Selection of 9 from 100 records - Günther R. Raidl has 71 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page