The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Günther R. Raidl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jens Gottlieb, Günther R. Raidl
    Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Artificial Evolution, 1999, pp:38-52 [Conf]
  2. Günther R. Raidl
    Skillful Genotype Decoding in EAs for Solving the Cutting Problem. [Citation Graph (0, 0)][DBLP]
    Evolutionary Programming, 1996, pp:113-120 [Conf]
  3. Sandor Kersting, Günther R. Raidl, Ivana Ljubic
    A Memetic Algorithm for Vertex-Biconnectivity Augmentation. [Citation Graph (0, 0)][DBLP]
    EvoWorkshops, 2002, pp:102-111 [Conf]
  4. Ivana Ljubic, Günther R. Raidl
    An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem. [Citation Graph (0, 0)][DBLP]
    EvoWorkshops, 2001, pp:20-29 [Conf]
  5. Jakob Puchinger, Günther R. Raidl, Gabriele Koller
    Solving a Real-World Glass Cutting Problem. [Citation Graph (0, 0)][DBLP]
    EvoCOP, 2004, pp:165-176 [Conf]
  6. Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
    The Core Concept for the Multidimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    EvoCOP, 2006, pp:195-208 [Conf]
  7. Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger
    Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    EvoCOP, 2007, pp:176-187 [Conf]
  8. Jens Gottlieb, Günther R. Raidl
    The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search. [Citation Graph (0, 0)][DBLP]
    GECCO, 2000, pp:283-290 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    GECCO, 2006, pp:1187-1194 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    GECCO (1), 2004, pp:1304-1315 [Conf]
  11. Günther R. Raidl
    A Unified View on Hybrid Metaheuristics. [Citation Graph (0, 0)][DBLP]
    Hybrid Metaheuristics, 2006, pp:1-12 [Conf]
  12. Jakob Puchinger, Günther R. Raidl
    Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. [Citation Graph (0, 0)][DBLP]
    IWINAC (2), 2005, pp:41-53 [Conf]
  13. Günther R. Raidl, Gabriele Kodydek
    Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks. [Citation Graph (0, 0)][DBLP]
    NC, 1998, pp:885-890 [Conf]
  14. Gabriele Koller, Günther R. Raidl
    An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem. [Citation Graph (0, 0)][DBLP]
    PPSN, 2004, pp:302-311 [Conf]
  15. Ivana Ljubic, Günther R. Raidl, Jozef Kratica
    A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. [Citation Graph (0, 0)][DBLP]
    PPSN, 2000, pp:641-650 [Conf]
  16. Jakob Puchinger, Günther R. Raidl
    An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. [Citation Graph (0, 0)][DBLP]
    PPSN, 2004, pp:642-651 [Conf]
  17. Günther R. Raidl, Gabriele Kodydek
    Genetic Algorithms for the Multiple Container Packing Problem. [Citation Graph (0, 0)][DBLP]
    PPSN, 1998, pp:875-884 [Conf]
  18. Günther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom
    On Weight-Biased Mutation for Graph Problems. [Citation Graph (0, 0)][DBLP]
    PPSN, 2002, pp:204-213 [Conf]
  19. Harald Feltl, Günther R. Raidl
    An improved hybrid genetic algorithm for the generalized assignment problem. [Citation Graph (0, 0)][DBLP]
    SAC, 2004, pp:990-995 [Conf]
  20. Bryant A. Julstrom, Günther R. Raidl
    Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. [Citation Graph (0, 0)][DBLP]
    SAC, 2001, pp:321-326 [Conf]
  21. Bryant A. Julstrom, Günther R. Raidl
    Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. [Citation Graph (0, 0)][DBLP]
    SAC, 2002, pp:547-552 [Conf]
  22. Günther R. Raidl
    A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem. [Citation Graph (0, 0)][DBLP]
    SAC, 1999, pp:291-296 [Conf]
  23. Günther R. Raidl, Bryant A. Julstrom
    A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    SAC (1), 2000, pp:440-445 [Conf]
  24. Günther R. Raidl, Bryant A. Julstrom
    Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    SAC, 2003, pp:747-752 [Conf]
  25. Roger L. Wainwright, Günther R. Raidl
    Evolutionary computation and optimization track. [Citation Graph (0, 0)][DBLP]
    SAC, 2001, pp:315- [Conf]
  26. Roger L. Wainwright, Günther R. Raidl
    Evolutionary computation and optimization track: SAC 2002. [Citation Graph (0, 0)][DBLP]
    SAC, 2002, pp:541- [Conf]
  27. 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. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computation, 2005, v:13, n:4, pp:441-475 [Journal]
  28. Ivana Ljubic, Günther R. Raidl
    A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2003, v:9, n:5, pp:401-427 [Journal]
  29. Günther R. Raidl, Ivana Ljubic
    Evolutionary local search for the edge-biconnectivity augmentation problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:1, pp:39-45 [Journal]
  30. Günther R. Raidl, Bryant A. Julstrom
    Edge sets: an effective evolutionary coding of spanning trees. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2003, v:7, n:3, pp:225-239 [Journal]
  31. Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom
    Biased Mutation Operators for Subgraph-Selection Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2006, v:10, n:2, pp:145-156 [Journal]
  32. Andreas M. Chwatal, Günther R. Raidl
    Determining Orbital Elements of Extrasolar Planets by Evolution Strategies. [Citation Graph (0, 0)][DBLP]
    EUROCAST, 2007, pp:870-877 [Conf]

  33. Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics. [Citation Graph (, )][DBLP]


  34. Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms. [Citation Graph (, )][DBLP]


  35. A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. [Citation Graph (, )][DBLP]


  36. Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. [Citation Graph (, )][DBLP]


  37. A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse. [Citation Graph (, )][DBLP]


  38. Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive. [Citation Graph (, )][DBLP]


  39. Multilevel Variable Neighborhood Search for Periodic Routing Problems. [Citation Graph (, )][DBLP]


  40. Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. [Citation Graph (, )][DBLP]


  41. Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances. [Citation Graph (, )][DBLP]


  42. Meta-heuristics for reconstructing cross cut shredded text documents. [Citation Graph (, )][DBLP]


  43. Fitting multi-planet transit models to photometric time-data series by evolution strategies. [Citation Graph (, )][DBLP]


  44. A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem. [Citation Graph (, )][DBLP]


  45. Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem. [Citation Graph (, )][DBLP]


  46. Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows. [Citation Graph (, )][DBLP]


  47. Combining Forces to Reconstruct Strip Shredded Text Documents. [Citation Graph (, )][DBLP]


  48. Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. [Citation Graph (, )][DBLP]


  49. Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search. [Citation Graph (, )][DBLP]


  50. Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. [Citation Graph (, )][DBLP]


  51. Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem. [Citation Graph (, )][DBLP]


  52. Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. [Citation Graph (, )][DBLP]


  53. A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. [Citation Graph (, )][DBLP]


  54. Trend-Based Similarity Search in Time-Series Data. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002