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

Günther R. Raidl Vis

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

*2009
60EEAndreas M. Chwatal, Günther R. Raidl: Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms. EUROCAST 2009: 649-656
59EEMartin Gruber, Günther R. Raidl: Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics. EUROCAST 2009: 665-672
58EEMario Ruthmair, Günther R. Raidl: A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST 2009: 713-720
57EEMatthias Prandtstetter, Günther R. Raidl, Thomas Misar: A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse. EvoCOP 2009: 25-36
56EEMartin Gruber, Günther R. Raidl: Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances. GECCO 2009: 263-270
55EEMatthias Prandtstetter, Günther R. Raidl: Meta-heuristics for reconstructing cross cut shredded text documents. GECCO 2009: 349-356
54EESandro 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
53EEJakob Walla, Mario Ruthmair, Günther R. Raidl: Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search. Hybrid Metaheuristics 2009: 84-99
2008
52EEBin Hu, Günther R. Raidl: Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. EvoCOP 2008: 36-47
51EESandro Pirkwieser, Günther R. Raidl: Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. GECCO 2008: 323-330
50EEMarkus Leitner, Günther R. Raidl: Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. Hybrid Metaheuristics 2008: 158-174
49EEMatthias Prandtstetter, Günther R. Raidl: Combining Forces to Reconstruct Strip Shredded Text Documents. Hybrid Metaheuristics 2008: 175-189
48EEMarkus Leitner, Günther R. Raidl: Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem. SAINT 2008: 233-236
47EEMartin Gruber, Günther R. Raidl: Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. SAINT 2008: 261-264
46EEGünther R. Raidl, Jakob Puchinger: Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization. Hybrid Metaheuristics 2008: 31-62
45EESandro 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
44EEMatthias Prandtstetter, Günther R. Raidl: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. European Journal of Operational Research 191(3): 1004-1022 (2008)
43EEJakob Puchinger, Günther R. Raidl: Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J. Heuristics 14(5): 457-472 (2008)
42EEBin Hu, Markus Leitner, Günther R. Raidl: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J. Heuristics 14(5): 473-499 (2008)
2007
41EEAndreas M. Chwatal, Günther R. Raidl: Determining Orbital Elements of Extrasolar Planets by Evolution Strategies. EUROCAST 2007: 870-877
40EESandro 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
39EEJakob Puchinger, Günther R. Raidl: Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research 183(3): 1304-1327 (2007)
2006
38 Jens Gottlieb, Günther R. Raidl: Evolutionary Computation in Combinatorial Optimization, 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings Springer 2006
37EEJakob Puchinger, Günther R. Raidl, Ulrich Pferschy: The Core Concept for the Multidimensional Knapsack Problem. EvoCOP 2006: 195-208
36EEMartin Gruber, Jano I. van Hemert, Günther R. Raidl: Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. GECCO 2006: 1187-1194
35EEGünther R. Raidl: A Unified View on Hybrid Metaheuristics. Hybrid Metaheuristics 2006: 1-12
34EEDaniel Wagner, Günther R. Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl: A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. OR 2006: 197-202
33EEGünther R. Raidl, Gabriele Koller, Bryant A. Julstrom: Biased Mutation Operators for Subgraph-Selection Problems. IEEE Trans. Evolutionary Computation 10(2): 145-156 (2006)
2005
32 Günther R. Raidl, Jens Gottlieb: Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings Springer 2005
31EEJakob Puchinger, Günther R. Raidl: Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. IWINAC (2) 2005: 41-53
30EEGünther R. Raidl, Jens Gottlieb: Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem. Evolutionary Computation 13(4): 441-475 (2005)
2004
29 Jens Gottlieb, Günther R. Raidl: Evolutionary Computation in Combinatorial Optimization, 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings Springer 2004
28 Günther R. Raidl, Stefano Cagnoni, Jürgen Branke, David Corne, Rolf Drechsler, Yaochu Jin, Colin G. Johnson, Penousal Machado, Elena Marchiori, Franz Rothlauf, George D. Smith, Giovanni Squillero: Applications of Evolutionary Computing, EvoWorkshops 2004: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC, Coimbra, Portugal, April 5-7, 2004, Proceedings Springer 2004
27EEJakob Puchinger, Günther R. Raidl, Gabriele Koller: Solving a Real-World Glass Cutting Problem. EvoCOP 2004: 165-176
26EEGunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher: Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) 2004: 1304-1315
25EEGabriele Koller, Günther R. Raidl: An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem. PPSN 2004: 302-311
24EEJakob Puchinger, Günther R. Raidl: An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. PPSN 2004: 642-651
23EEHarald Feltl, Günther R. Raidl: An improved hybrid genetic algorithm for the generalized assignment problem. SAC 2004: 990-995
2003
22 Günther R. Raidl, Jean-Arcady Meyer, Martin Middendorf, Stefano Cagnoni, Juan J. Romero Cardalda, David Corne, Jens Gottlieb, Agnès Guillot, Emma Hart, Colin G. Johnson, Elena Marchiori: Applications of Evolutionary Computing, EvoWorkshop 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April 14-16, 2003, Proceedings Springer 2003
21 Günther R. Raidl, Bryant A. Julstrom: Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. SAC 2003: 747-752
20 Günther R. Raidl, Bryant A. Julstrom: Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evolutionary Computation 7(3): 225-239 (2003)
19 Ivana Ljubic, Günther R. Raidl: A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. J. Heuristics 9(5): 401-427 (2003)
2002
18 Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl: Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings Springer 2002
17EESandor Kersting, Günther R. Raidl, Ivana Ljubic: A Memetic Algorithm for Vertex-Biconnectivity Augmentation. EvoWorkshops 2002: 102-111
16EEGünther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom: On Weight-Biased Mutation for Graph Problems. PPSN 2002: 204-213
15EERoger L. Wainwright, Günther R. Raidl: Evolutionary computation and optimization track: SAC 2002. SAC 2002: 541
14EEBryant A. Julstrom, Günther R. Raidl: Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. SAC 2002: 547-552
13EEGünther R. Raidl, Ivana Ljubic: Evolutionary local search for the edge-biconnectivity augmentation problem. Inf. Process. Lett. 82(1): 39-45 (2002)
2001
12 Egbert J. W. Boers, Jens Gottlieb, Pier Luca Lanzi, Robert E. Smith, Stefano Cagnoni, Emma Hart, Günther R. Raidl, H. Tijink: Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings Springer 2001
11EEIvana Ljubic, Günther R. Raidl: An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem. EvoWorkshops 2001: 20-29
10EERoger L. Wainwright, Günther R. Raidl: Evolutionary computation and optimization track. SAC 2001: 315
9EEBryant A. Julstrom, Günther R. Raidl: Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. SAC 2001: 321-326
2000
8 Jens Gottlieb, Günther R. Raidl: The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search. GECCO 2000: 283-290
7EEIvana Ljubic, Günther R. Raidl, Jozef Kratica: A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. PPSN 2000: 641-650
6 Günther R. Raidl, Bryant A. Julstrom: A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. SAC (1) 2000: 440-445
1999
5 Jens Gottlieb, Günther R. Raidl: Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem. Artificial Evolution 1999: 38-52
4EEGünther R. Raidl: A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem. SAC 1999: 291-296
1998
3 Günther R. Raidl, Gabriele Kodydek: Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks. NC 1998: 885-890
2EEGünther R. Raidl, Gabriele Kodydek: Genetic Algorithms for the Multiple Container Packing Problem. PPSN 1998: 875-884
1996
1 Günther R. Raidl: Skillful Genotype Decoding in EAs for Solving the Cutting Problem. Evolutionary Programming 1996: 113-120

Coauthor Index

1Peter Bachhiesl [34]
2Egbert J. W. Boers [12]
3Jürgen Branke [28]
4Stefano Cagnoni [12] [18] [22] [28]
5Juan J. Romero Cardalda [22]
6Andreas M. Chwatal [41] [60]
7David W. Corne (David Corne) [22] [28]
8Rolf Drechsler [28]
9Harald Feltl [23]
10Jens Gottlieb [5] [8] [12] [18] [22] [29] [30] [32] [38]
11Martin Gruber [36] [47] [56] [59]
12Agnès Guillot [22]
13Emma Hart [12] [18] [22]
14Jano I. van Hemert [36]
15Bin Hu [42] [52]
16Yaochu Jin [28]
17Colin G. Johnson [22] [28]
18Bryant A. Julstrom [6] [9] [14] [16] [20] [21] [33]
19Sandor Kersting [17]
20Gunnar W. Klau [26]
21Gabriele Kodydek [2] [3] [16]
22Gabriele Koller [25] [27] [33]
23Jozef Kratica [7]
24Pier Luca Lanzi [12]
25Markus Leitner [42] [48] [50]
26Ivana Ljubic [7] [11] [13] [17] [19] [26]
27Penousal Machado [28]
28Elena Marchiori [22] [28]
29Jean-Arcady Meyer [22]
30Martin Middendorf [18] [22]
31Thomas Misar [57]
32Andreas Moser [26]
33Petra Mutzel [26] [34]
34Philipp Neuner [26]
35Ulrich Pferschy [26] [34] [37]
36Sandro Pirkwieser [40] [45] [51] [54]
37Matthias Prandtstetter [44] [49] [55] [57]
38Jakob Puchinger [24] [27] [31] [37] [39] [40] [43] [45] [46]
39Franz Rothlauf [28]
40Mario Ruthmair [53] [58]
41George D. Smith [28]
42Robert Elliott Smith (Robert E. Smith) [12]
43Giovanni Squillero [28]
44H. Tijink [12]
45Daniel Wagner [34]
46Roger L. Wainwright [10] [15]
47Jakob Walla [53]
48René Weiskircher [26]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)