2009 |
53 | EE | Matthias Prandtstetter,
Günther R. Raidl,
Thomas Misar:
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse.
EvoCOP 2009: 25-36 |
2008 |
52 | EE | Bin Hu,
Günther R. Raidl:
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem.
EvoCOP 2008: 36-47 |
51 | EE | Sandro Pirkwieser,
Günther R. Raidl:
Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms.
GECCO 2008: 323-330 |
50 | EE | Markus 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 |
49 | EE | Matthias Prandtstetter,
Günther R. Raidl:
Combining Forces to Reconstruct Strip Shredded Text Documents.
Hybrid Metaheuristics 2008: 175-189 |
48 | EE | Markus Leitner,
Günther R. Raidl:
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem.
SAINT 2008: 233-236 |
47 | EE | Martin 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 |
46 | EE | Günther R. Raidl,
Jakob Puchinger:
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization.
Hybrid Metaheuristics 2008: 31-62 |
45 | EE | Sandro 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 |
44 | EE | Matthias 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) |
43 | EE | Jakob Puchinger,
Günther R. Raidl:
Bringing order into the neighborhoods: relaxation guided variable neighborhood search.
J. Heuristics 14(5): 457-472 (2008) |
42 | EE | Bin 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 |
41 | EE | Andreas M. Chwatal,
Günther R. Raidl:
Determining Orbital Elements of Extrasolar Planets by Evolution Strategies.
EUROCAST 2007: 870-877 |
40 | EE | Sandro 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 |
39 | EE | Jakob 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 |
37 | EE | Jakob Puchinger,
Günther R. Raidl,
Ulrich Pferschy:
The Core Concept for the Multidimensional Knapsack Problem.
EvoCOP 2006: 195-208 |
36 | EE | Martin 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 |
35 | EE | Günther R. Raidl:
A Unified View on Hybrid Metaheuristics.
Hybrid Metaheuristics 2006: 1-12 |
34 | EE | Daniel 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 |
33 | EE | Gü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 |
31 | EE | Jakob Puchinger,
Günther R. Raidl:
Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification.
IWINAC (2) 2005: 41-53 |
30 | EE | Gü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 |
27 | EE | Jakob Puchinger,
Günther R. Raidl,
Gabriele Koller:
Solving a Real-World Glass Cutting Problem.
EvoCOP 2004: 165-176 |
26 | EE | Gunnar 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 |
25 | EE | Gabriele Koller,
Günther R. Raidl:
An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem.
PPSN 2004: 302-311 |
24 | EE | Jakob 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 |
23 | EE | Harald 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 |
17 | EE | Sandor Kersting,
Günther R. Raidl,
Ivana Ljubic:
A Memetic Algorithm for Vertex-Biconnectivity Augmentation.
EvoWorkshops 2002: 102-111 |
16 | EE | Günther R. Raidl,
Gabriele Kodydek,
Bryant A. Julstrom:
On Weight-Biased Mutation for Graph Problems.
PPSN 2002: 204-213 |
15 | EE | Roger L. Wainwright,
Günther R. Raidl:
Evolutionary computation and optimization track: SAC 2002.
SAC 2002: 541 |
14 | EE | Bryant A. Julstrom,
Günther R. Raidl:
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges.
SAC 2002: 547-552 |
13 | EE | Gü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 |
11 | EE | Ivana Ljubic,
Günther R. Raidl:
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem.
EvoWorkshops 2001: 20-29 |
10 | EE | Roger L. Wainwright,
Günther R. Raidl:
Evolutionary computation and optimization track.
SAC 2001: 315 |
9 | EE | Bryant 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 |
7 | | Ivana 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 |
4 | EE | Gü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 |
2 | EE | Gü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 |