Günther R. Raidl

Markus Leitner, Mario Ruthmair, Günther R. Raidl: Stabilizing branch-and-price for constrained tree problems. Networks 61(2): 150-170 (2013)

Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl: Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach. EvoCOP 2013: 121-132

Johannes Inführ, Günther R. Raidl: Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent. EvoCOP 2013: 250-261

Clemens Nothegger, Alfred Mayer, Andreas M. Chwatal, Günther R. Raidl: Solving the post enrolment course timetabling problem by ant colony optimization. Annals OR 194(1): 325-339 (2012)

Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger, Günther R. Raidl: Hybrid Heuristics for Multimodal Homecare Scheduling. CPAIOR 2012: 339-355

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

Thorsten Krenek, Mario Ruthmair, Günther R. Raidl, Michael Planer: Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles. EvoApplications 2012: 376-385

Bin Hu, Günther R. Raidl: An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. GECCO 2012: 393-400

Mario Ruthmair, Günther R. Raidl: On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem. ISCO 2012: 225-236

Christian Schauer, Günther R. Raidl: Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design. PPSN (1) 2012: 458-467

Andreas M. Chwatal, Günther R. Raidl: Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques. Adv. Operations Research 2011 (2011)

Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli: Hybrid metaheuristics in combinatorial optimization: A survey. Appl. Soft Comput. 11(6): 4135-4151 (2011)

Markus Leitner, Günther R. Raidl: Branch-and-Cut-and-Price for Capacitated Connected Facility Location. J. Math. Model. Algorithms 10(3): 245-267 (2011)

Johannes Inführ, Günther R. Raidl: Automatic Generation of 2-AntWars Players with Genetic Programming. EUROCAST (1) 2011: 248-255

Martin Berlakovich, Mario Ruthmair, Günther R. Raidl: A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST (1) 2011: 256-263

Bin Hu, Günther R. Raidl: An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem. EUROCAST (1) 2011: 287-294

Markus Leitner, Günther R. Raidl: Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location. EUROCAST (1) 2011: 295-302

Mario Ruthmair, Günther R. Raidl: A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST (1) 2011: 351-358

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

Andreas M. Chwatal, Corinna Thöni, Karin Oberlechner, Günther R. Raidl: A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application. FedCSIS 2011: 239-246

Johannes Inführ, Günther R. Raidl: Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints. INOC 2011: 105-117

Markus Leitner, Mario Ruthmair, Günther R. Raidl: Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem. INOC 2011: 124-138

Mario Ruthmair, Günther R. Raidl: A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. IPCO 2011: 376-388

Markus Leitner, Günther R. Raidl: Strong Lower Bounds for a Survivable Network Design Problem. Electronic Notes in Discrete Mathematics 36: 295-302 (2010)

Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy: The Multidimensional Knapsack Problem: Structure and Algorithms. INFORMS Journal on Computing 22(2): 250-265 (2010)

Bin Hu, Markus Leitner, Günther R. Raidl: The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search. Networks 55(3): 256-275 (2010)

Martin Suntinger, Hannes Obweger, Josef Schiefer, Philip Limbeck, Günther R. Raidl: Trend-Based Similarity Search in Time-Series Data. DBKDA 2010: 97-106

Sandro Pirkwieser, Günther R. Raidl: Multilevel Variable Neighborhood Search for Periodic Routing Problems. EvoCOP 2010: 226-238

Günther R. Raidl, Bin Hu: Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive. EvoCOP 2010: 239-251

Andreas M. Chwatal, Günther R. Raidl, Michael Zöch: Fitting multi-planet transit models to photometric time-data series by evolution strategies. GECCO 2010: 377-384

Andreas M. Chwatal, Günther R. Raidl: Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization. GEM 2010: 91-97

Christian Schauer, Matthias Prandtstetter, Günther R. Raidl: A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents. Hybrid Metaheuristics 2010: 103-117

Sandro 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

Anna Pagacz, Bin Hu, Günther R. Raidl: A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem. INCoS 2010: 356-361

Mario Ruthmair, Günther R. Raidl: Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. PPSN (2) 2010: 391-400

Hannes Obweger, Martin Suntinger, Josef Schiefer, Günther R. Raidl: Similarity Searching in Sequences of Complex Events. RCIS 2010: 631-640

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

Martin Gruber, Günther R. Raidl: (Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. Matheuristics 2010: 209-229

Maria J. Blesa, Christian Blum, Günther R. Raidl, Andrea Roli, Michael Sampels (Eds.): Hybrid Metaheuristics - 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010. Proceedings. Lecture Notes in Computer Science 6373, Springer 2010, isbn 978-3-642-16053-0

Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner: Solving a k-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates. J. Math. Model. Algorithms 8(3): 293-334 (2009)

Andreas M. Chwatal, Günther R. Raidl: Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms. EUROCAST 2009: 649-656

Martin Gruber, Günther R. Raidl: Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics. EUROCAST 2009: 665-672

Mario Ruthmair, Günther R. Raidl: A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST 2009: 713-720

Matthias Prandtstetter, Günther R. Raidl, Thomas Misar: A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse. EvoCOP 2009: 25-36

Martin Gruber, Günther R. Raidl: Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances. GECCO 2009: 263-270

Matthias Prandtstetter, Günther R. Raidl: Meta-heuristics for reconstructing cross cut shredded text documents. GECCO 2009: 349-356

Bin Hu, Günther R. Raidl: A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem. HIS (3) 2009: 63-68

Sandro 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

Jakob 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

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)

Jakob Puchinger, Günther R. Raidl: Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J. Heuristics 14(5): 457-472 (2008)

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)

Bin Hu, Günther R. Raidl: Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. EvoCOP 2008: 36-47

Sandro Pirkwieser, Günther R. Raidl: Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. GECCO 2008: 323-330

Bin Hu, Günther R. Raidl: Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem. HIS 2008: 73-77

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

Matthias Prandtstetter, Günther R. Raidl: Combining Forces to Reconstruct Strip Shredded Text Documents. Hybrid Metaheuristics 2008: 175-189

Markus Leitner, Günther R. Raidl: Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem. SAINT 2008: 233-236

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

Günther R. Raidl, Jakob Puchinger: Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization. Hybrid Metaheuristics 2008: 31-62

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

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)

Andreas M. Chwatal, Günther R. Raidl: Determining Orbital Elements of Extrasolar Planets by Evolution Strategies. EUROCAST 2007: 870-877

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

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)

Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy: The Core Concept for the Multidimensional Knapsack Problem. EvoCOP 2006: 195-208

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

Günther R. Raidl: A Unified View on Hybrid Metaheuristics. Hybrid Metaheuristics 2006: 1-12

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

Jens Gottlieb, Günther R. Raidl (Eds.): Evolutionary Computation in Combinatorial Optimization, 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings. Lecture Notes in Computer Science 3906, Springer 2006, isbn 3-540-33178-6

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)

Jakob Puchinger, Günther R. Raidl: Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. IWINAC (2) 2005: 41-53

Günther R. Raidl, Jens Gottlieb (Eds.): Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings. Lecture Notes in Computer Science 3448, Springer 2005, isbn 3-540-25337-8

Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl, Colin Reeves: Editorial. J. Math. Model. Algorithms 3(4): 311-312 (2004)

Jakob Puchinger, Günther R. Raidl, Gabriele Koller: Solving a Real-World Glass Cutting Problem. EvoCOP 2004: 165-176

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

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

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

Harald Feltl, Günther R. Raidl: An improved hybrid genetic algorithm for the generalized assignment problem. SAC 2004: 990-995

Jens Gottlieb, Günther R. Raidl (Eds.): Evolutionary Computation in Combinatorial Optimization, 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings. Lecture Notes in Computer Science 3004, Springer 2004, isbn 3-540-21367-8

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 (Eds.): Applications of Evolutionary Computing, EvoWorkshops 2004: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC, Coimbra, Portugal, April 5-7, 2004, Proceedings. Lecture Notes in Computer Science 3005, Springer 2004, isbn 3-540-21378-3

Ivana Ljubic, Günther R. Raidl: A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. J. Heuristics 9(5): 401-427 (2003)

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)

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

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 (Eds.): Applications of Evolutionary Computing, EvoWorkshop 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April 14-16, 2003, Proceedings. Lecture Notes in Computer Science 2611, Springer 2003, isbn 3-540-00976-0

Günther R. Raidl, Ivana Ljubic: Evolutionary local search for the edge-biconnectivity augmentation problem. Inf. Process. Lett. 82(1): 39-45 (2002)

Sandor Kersting, Günther R. Raidl, Ivana Ljubic: A Memetic Algorithm for Vertex-Biconnectivity Augmentation. EvoWorkshops 2002: 102-111

Günther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom: On Weight-Biased Mutation for Graph Problems. PPSN 2002: 204-213

Roger L. Wainwright, Günther R. Raidl: Evolutionary computation and optimization track: SAC 2002. SAC 2002: 541

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

Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl (Eds.): Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings. Lecture Notes in Computer Science 2279, Springer 2002, isbn 3-540-43432-1

Ivana Ljubic, Günther R. Raidl: An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem. EvoWorkshops 2001: 20-29

Roger L. Wainwright, Günther R. Raidl: Evolutionary computation and optimization track. SAC 2001: 315

Bryant A. Julstrom, Günther R. Raidl: Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. SAC 2001: 321-326

Egbert J. W. Boers, Jens Gottlieb, Pier Luca Lanzi, Robert E. Smith, Stefano Cagnoni, Emma Hart, Günther R. Raidl, H. Tijink (Eds.): Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings. Lecture Notes in Computer Science 2037, Springer 2001, isbn 3-540-41920-9

Jens Gottlieb, Günther R. Raidl: The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search. GECCO 2000: 283-290

Ivana Ljubic, Günther R. Raidl, Jozef Kratica: A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. PPSN 2000: 641-650

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

Jens Gottlieb, Günther R. Raidl: Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem. Artificial Evolution 1999: 38-52

Günther R. Raidl: A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem. SAC 1999: 291-296

Günther R. Raidl, Gabriele Kodydek: Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks. NC 1998: 885-890

Günther R. Raidl, Gabriele Kodydek: Genetic Algorithms for the Multiple Container Packing Problem. PPSN 1998: 875-884

Günther R. Raidl: Skillful Genotype Decoding in EAs for Solving the Cutting Problem. Evolutionary Programming 1996: 113-120