Günther R. Raidl

Günther R. Raidl, Josef Schiefer, Martin Suntinger, 2010, 2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications.

Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics

Günther R. Raidl, Johannes Maschler, Martin Riedler, 2016 .

The multiple container packing problem: a genetic algorithm approach with weighted codings

Günther R. Raidl, 1999, SIAP.

A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem

Günther R. Raidl, Martin Schwengerer, Sandro Pirkwieser, 2012, EvoCOP.

Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location

Markus Leitner, Günther R. Raidl, G. Raidl, 2011, EUROCAST.

Transforming an analytically defined color space to match psychophysically gained color distances

Ingeborg Tastl, Günther R. Raidl, 1998, Electronic Imaging.

Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm

Günther R. Raidl, Christian Blum, Matthias Horn, 2019, Artif. Intell..

Districting and Routing for Security Control

Günther R. Raidl, Benjamin Biesinger, Christian Kloimüllner, 2016, HM.

Skillful Genotype Decoding in EAs for Solving the Cutting Problem

Günther R. Raidl, 1996, Evolutionary Programming.

A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem

Günther R. Raidl, Frederico Dusberger, G. Raidl, 2014, Hybrid Metaheuristics.

Improved Packing and Routing of Vehicles with Compartments

Günther R. Raidl, Jens Gottlieb, Sandro Pirkwieser, 2011, EUROCAST.

A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem

Günther R. Raidl, Bin Hu, 2009, 2009 Ninth International Conference on Hybrid Intelligent Systems.

Multilevel Variable Neighborhood Search for Periodic Routing Problems

Günther R. Raidl, Sandro Pirkwieser, G. Raidl, 2010, EvoCOP.

Accelerating Column Generation for a Survivable Network Design Problem

Markus Leitner, Günther R. Raidl, Ulrich Pferschy, 2009 .

Determining Orbital Elements of Extrasolar Planets by Evolution Strategies

Günther R. Raidl, Andreas M. Chwatal, G. Raidl, 2007, EUROCAST.

Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles

Günther R. Raidl, Christopher Bacher, Thorsten Krenek, 2014, EvoApplications.

Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case

Günther R. Raidl, Bin Hu, Christian Kloimüllner, 2014, EvoCOP.

A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles

Günther R. Raidl, Christopher Bacher, Thorsten Krenek, 2015, EUROCAST.

Evolutionary computation and optimization track (formally the genetic algorithms track) (track introduction only)

Günther R. Raidl, Roger L. Wainwright, 2000, SAC '00.

A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design

Günther R. Raidl, Christian Schauer, G. Raidl, 2016, Electron. Notes Discret. Math..

PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems

Günther R. Raidl, Bin Hu, Christian Kloimüllner, 2014, Journal of Global Optimization.

Springer Handbook of Computational Intelligence

Thomas Bartz-Beielstein, Carlos A. Coello Coello, Günther R. Raidl, 2015, Springer Handbook of Computational Intelligence.

Evolutionary Computation in Combinatorial Optimization (vol. # 3906) : 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings

Günther R. Raidl, EvoCOP, Jens Gottlieb, 2006 .

Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location

Markus Leitner, Günther R. Raidl, 2009 .

The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search

Markus Leitner, Günther R. Raidl, Bin Hu, 2010, Networks.

Using Optimized Virtual Network Embedding for Network Dimensioning

Günther R. Raidl, David Stezenbach, Matthias Hartmann, 2013, 2013 Conference on Networked Systems.

Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows

Günther R. Raidl, Sandro Pirkwieser, G. Raidl, 2009, Hybrid Metaheuristics.

On Weight-Biased Mutation for Graph Problems

Bryant A. Julstrom, Günther R. Raidl, Gabriele Kodydek, 2002, PPSN.

Casual Employee Scheduling with Constraint Programming and Metaheuristics

Günther R. Raidl, Nikolaus Frohner, Stephan Teuschl, 2019, EUROCAST.

On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms

Günther R. Raidl, Jens Gottlieb, 2002 .

Strategies for Iteratively Refining Layered Graph Models

Günther R. Raidl, Martin Riedler, Mario Ruthmair, 2019, HM.

Hybridization Based on Large Neighborhood Search

Christian Blum, Günther R. Raidl, 2016 .

A Memetic Algorithm for Multi Layer Hierarchical Ring Network Design

Günther R. Raidl, Christian Schauer, 2014, PPSN.

An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior

Günther R. Raidl, Benjamin Biesinger, Bin Hu, 2014, LION.

Applications of Evolutionary Computing: Evoworkshops 2003

Elena Marchiori, David Corne, Stefano Cagnoni, 2003 .

Semi-Automated Location Planning for Urban Bike-Sharing Systems

Anita Graser, Markus Straub, Günther R. Raidl, 2018 .

Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem

Günther R. Raidl, Sandro Pirkwieser, G. Raidl, 2010, Hybrid Metaheuristics.

The Multidimensional Knapsack Problem: Structure and Algorithms

Günther R. Raidl, Ulrich Pferschy, Jakob Puchinger, 2010, INFORMS J. Comput..

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem

Günther R. Raidl, Jakob Puchinger, Sandro Pirkwieser, 2008, Recent Advances in Evolutionary Computation for Combinatorial Optimization.

A∗-based construction of decision diagrams for a prize-collecting scheduling problem

Günther R. Raidl, Elina Rönnberg, Johannes Maschler, 2021, Comput. Oper. Res..

Anytime algorithms for the longest common palindromic subsequence problem

Christian Blum, Günther R. Raidl, Marko Djukanovic, 2020, Comput. Oper. Res..

A weight-coded genetic algorithm for the multiple container packing problem

Günther R. Raidl, 1999, SAC '99.

Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

Jano I. van Hemert, Martin Gruber, Günther R. Raidl, 2006, GECCO.

Solving a Real-World Glass Cutting Problem

Günther R. Raidl, Jakob Puchinger, Gabriele Koller, 2004, EvoCOP.

A Genetic Algorithm for Labeling Point Features

Günther R. Raidl, G. Raidl, 2003 .

A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem

Andreas T. Ernst, Günther R. Raidl, Matthias Horn, 2019, Australasian Conference on Artificial Intelligence.

Stabilizing branch-and-price for constrained tree problems

Markus Leitner, Günther R. Raidl, Mario Ruthmair, 2013, Networks.

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

Günther R. Raidl, Ivana Ljubic, G. Raidl, 2003, J. Heuristics.

(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther R. Raidl, 2010, Matheuristics.

A Hybrid GA for the Edge-Biconnectivity Augmentation Problem

Jozef Kratica, Günther R. Raidl, Ivana Ljubic, 2000, PPSN.

Solving a selective dial-a-ride problem with logic-based Benders decomposition

Günther R. Raidl, Martin Riedler, G. Raidl, 2018, Comput. Oper. Res..

Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques

Günther R. Raidl, Andreas M. Chwatal, 2011, Adv. Oper. Res..

Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem

Günther R. Raidl, Bin Hu, 2008, 2008 Eighth International Conference on Hybrid Intelligent Systems.

Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem

Günther R. Raidl, Olivia Dietzel, Andreas M. Chwatal, 2007 .

Evolutionary computation and optimization track

Günther R. Raidl, Roger L. Wainwright, 2001, SAC.

Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees

Günther R. Raidl, Sandro Pirkwieser, Ruben Ruiz-Torrubiano, 2008 .

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN

Stefano Cagnoni, Martin Middendorf, Günther R. Raidl, 2002 .

A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation

Günther R. Raidl, Christian Blum, Marko Djukanovic, 2019, LOD.

Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid

Günther R. Raidl, Bin Hu, Christian Kloimüllner, 2014, PPSN.

Distributing Battery Swapping Stations for Electric Scooters in an Urban Area

Günther R. Raidl, Thomas Jatschka, Fabio F. Oberweger, 2020, OPTIMA.

Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search

Günther R. Raidl, Mario Ruthmair, Jakob Walla, 2009, Hybrid Metaheuristics.

An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem

Günther R. Raidl, Johannes Maschler, Martin Riedler, 2020, Int. Trans. Oper. Res..

Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics

Martin Gruber, Günther R. Raidl, G. Raidl, 2009, EUROCAST.

Computational performance evaluation of two integer linear programming models for the minimum common string partition problem

Christian Blum, Günther R. Raidl, C. Blum, 2015, Optim. Lett..

Applications of Evolutionary Computing

Rolf Drechsler, Franz Rothlauf, Elena Marchiori, 2004, Lecture Notes in Computer Science.

Decomposition based hybrid metaheuristics

Günther R. Raidl, G. Raidl, 2015, Eur. J. Oper. Res..

Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem

Markus Leitner, Günther R. Raidl, 2008, 2008 International Symposium on Applications and the Internet.

Full‐load route planning for balancing bike sharing systems by logic‐based benders decomposition

Günther R. Raidl, Christian Kloimüllner, G. Raidl, 2017, Networks.

Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles

Günther R. Raidl, Mario Ruthmair, Thorsten Krenek, 2012, EvoApplications.

Making Use of a Parallel, Non-independent, Construction of SolutionsWithin Metaheuristics

Christian Blum, Günther R. Raidl, 2016 .

Heuristic Approaches for the Probabilistic Traveling Salesman Problem

Günther R. Raidl, Benjamin Biesinger, Bin Hu, 2015, EUROCAST.

Large neighborhood search for the most strings with few bad columns problem

Günther R. Raidl, Maria J. Blesa, Evelia Lizárraga, 2017, Soft Comput..

Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent

Günther R. Raidl, Johannes Inführ, G. Raidl, 2013, EvoCOP.

Towards Improving Merging Heuristics for Binary Decision Diagrams

Günther R. Raidl, Nikolaus Frohner, 2019, LION.

Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms

Günther R. Raidl, Sandro Pirkwieser, G. Raidl, 2008, GECCO '08.

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem

Christian Blum, Günther R. Raidl, Marko Djukanovic, 2019, EUROCAST.

Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem

Christian Blum, Günther R. Raidl, Marko Djukanovic, 2018, LION.

Meta-heuristics for reconstructing cross cut shredded text documents

Matthias Prandtstetter, Günther R. Raidl, G. Raidl, 2009, GECCO.

Fitting multi-planet transit models to photometric time-data series by evolution strategies

Günther R. Raidl, Andreas M. Chwatal, Michael Zöch, 2010, GECCO '10.

A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem

Bryant A. Julstrom, Günther R. Raidl, G. Raidl, 2000, SAC '00.

A Unified View on Hybrid Metaheuristics

Günther R. Raidl, G. Raidl, 2006, Hybrid Metaheuristics.

Günther R. Raidl, Josef Schiefer, Martin Suntinger, 2010, 2010 Fourth International Conference on Research Challenges in Information Science (RCIS).

A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem

Günther R. Raidl, Matthias Horn, Thomas Kaufmann, 2020, PPSN.

An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands

Günther R. Raidl, Benjamin Biesinger, Bin Hu, 2016, Electron. Notes Discret. Math..

A Beam Search Approach to the Traveling Tournament Problem

Günther R. Raidl, Nikolaus Frohner, Bernhard Neumann, 2020, EvoCOP.

A Memetic Algorithm for Vertex-Biconnectivity Augmentation

Günther R. Raidl, Ivana Ljubic, Sandor Kersting, 2002, EvoWorkshops.

A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Günther R. Raidl, Mario Ruthmair, G. Raidl, 2009, EUROCAST.

A New Solution Representation for the Firefighter Problem

Günther R. Raidl, Bin Hu, Andreas Windbichler, 2015, EvoCOP.

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers

Günther R. Raidl, Herbert Fleischner, Benedikt Klocker, 2016, HM.

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks

Markus Leitner, Günther R. Raidl, G. Raidl, 2008, Hybrid Metaheuristics.

Evolutionary local search for the edge-biconnectivity augmentation problem

Günther R. Raidl, Ivana Ljubic, G. Raidl, 2002, Inf. Process. Lett..

A model for finding transition-minors

Günther R. Raidl, Herbert Fleischner, Benedikt Klocker, 2020, Discret. Appl. Math..

A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Günther R. Raidl, Mario Ruthmair, G. Raidl, 2011, EUROCAST.

Applications of evolutionary computing : EvoWorkshops 2004 : EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC, Coimbra, Portugal, April 5-7, 2004 : proceedings

Günther R. Raidl, EvoWorkshops, 2004 .

Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive

Günther R. Raidl, Bin Hu, G. Raidl, 2010, EvoCOP.

Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem

Günther R. Raidl, Jens Gottlieb, 1999, Artificial Evolution.

Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents

Günther R. Raidl, Benjamin Biesinger, Bin Hu, 2013, EUROCAST.

A Brief Survey on Hybrid Metaheuristics

Christian Blum, Andrea Roli, Günther R. Raidl, 2010 .

A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size

Günther R. Raidl, Frederico Dusberger, 2015, EUROCAST.

An evolutionary approach to point-feature label placement

Günther R. Raidl, 1999 .

A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

Günther R. Raidl, Elina Rönnberg, Matthias Horn, 2020 .

Fitting Multi-Planet Transit Models to CoRoT Time-Data Series by Evolutionary Algorithms

Günther R. Raidl, Günther Wuchterl, Andreas M. Chwatal, 2009 .

A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three

Günther R. Raidl, Herbert Fleischner, Benedikt Klocker, 2020, Appl. Math. Comput..

Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks

Günther R. Raidl, Gabriele Kodydek, 1998, NC.

Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification

Günther R. Raidl, Jakob Puchinger, G. Raidl, 2005, IWINAC.

Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization

Günther R. Raidl, Andreas M. Chwatal, 2010, GEM.

A METAHEURISTIC APPROACH FOR INTEGRATED TIMETABLE BASED DESIGN OF RAILWAY INFRASTRUCTURE

Andreas Schöbel, Günther R. Raidl, Gerhard Besau, 2014 .

T.R. - Applications of Evolutionary Computing

Elena Marchiori, David Corne, Jean-Arcady Meyer, 2003 .

Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Günther R. Raidl, Mario Ruthmair, G. Raidl, 2010, PPSN.

Weight-biased edge-crossover in evolutionary algorithms for two graph problems

Bryant A. Julstrom, Günther R. Raidl, G. Raidl, 2001, SAC.

Numerical Optimisation of Electro Hybrid Powertrains

Günther R. Raidl, Christopher Bacher, Thorsten Krenek, 2015 .

Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem

Günther R. Raidl, Johannes Maschler, G. Raidl, 2018 .

An A*-Based Algorithm to Derive Relaxed Decision Diagrams for a Prize-Collecting Sequencing Problem

Günther R. Raidl, Elina Rönnberg, Johannes Maschler, 2018 .

A Memetic Algorithm for Competitive Facility Location Problems

Günther R. Raidl, Benjamin Biesinger, Bin Hu, 2019, Business and Consumer Analytics: New Ideas.

Hybrid Heuristics for Multimodal Homecare Scheduling

Matthias Prandtstetter, Günther R. Raidl, Jakob Puchinger, 2012, CPAIOR.

Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization

Günther R. Raidl, Jens Gottlieb, G. Raidl, 2005 .

On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem

Günther R. Raidl, Mario Ruthmair, 2012, ISCO.

Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design

Günther R. Raidl, Christian Schauer, 2012, PPSN.

Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther R. Raidl, G. Raidl, 2005 .

Hybridization Based on Problem Instance Reduction

Christian Blum, Günther R. Raidl, 2016 .

On Solving a Generalized Constrained Longest Common Subsequence Problem

Günther R. Raidl, Christian Blum, Christoph Berger, 2020, OPTIMA.

Solving a k-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates

Günther R. Raidl, Andreas M. Chwatal, Karin Oberlechner, 2009, J. Math. Model. Algorithms.

CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem

Günther R. Raidl, Christian Schauer, David Markvica, 2015, EUROCAST.

A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems

Günther R. Raidl, Mario Ruthmair, 2011, IPCO.

Evolutionary Computation in Combinatorial Optimization: 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings (Lecture Notes in Computer Science)

Günther R. Raidl, Jens Gottlieb, 2006 .

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem

Petra Mutzel, Günther R. Raidl, Ulrich Pferschy, 2004, GECCO.

A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem

Petrica C. Pop, Günther R. Raidl, Bin Hu, 2013, EUROCAST.

Applications of Evolutionary Computing - EvoWorkshops 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, EvoSTIM

Elena Marchiori, David Corne, Jean-Arcady Meyer, 2003 .

Genetic Algorithms for the Multiple Container Packing Problem

Günther R. Raidl, Gabriele Kodydek, G. Raidl, 1998, PPSN.

Session details: Evolutionary combinatorial optimization and metaheuristics track papers

Günther R. Raidl, Yew-Soon Ong, 2011, GECCO '11.

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

Günther R. Raidl, Benedikt Klocker, 2017, EUROCAST.

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks

Petra Mutzel, Günther R. Raidl, Ulrich Pferschy, 2006, OR.

Further Hybrids and Conclusions

Christian Blum, Günther R. Raidl, 2016 .

Evolutionary Computation: An Overview and Recent Trends

Günther R. Raidl, G. Raidl, 2005 .

Matheuristics for the Periodic Vehicle Routing Problem with Time Windows

Günther R. Raidl, Sandro Pirkwieser, G. Raidl, 2010 .

Hybridization Based on Complete Solution Archives

Christian Blum, Günther R. Raidl, 2016 .

A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem

Günther R. Raidl, Frederico Dusberger, 2015, OR.

A Hybrid Genetic Algorithm with Solution Archive for the Discrete ( r | p )-Centroid Problem – Full Result Tables

Günther R. Raidl, Benjamin Biesinger, Bin Hu, 2014 .

Incomplete Solution Representations and Decoders

Christian Blum, Günther R. Raidl, 2016 .

Bringing order into the neighborhoods: relaxation guided variable neighborhood search

Günther R. Raidl, Jakob Puchinger, 2008, J. Heuristics.

A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem

Günther R. Raidl, Bin Hu, Werner Ölz, 2013 .

Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings

Günther R. Raidl, EvoCOP, Jens Gottlieb, 2005, EvoCOP.

Refining Partial Invalidations for Indexed Algebraic Dynamic Programming

Günther R. Raidl, Christopher Bacher, G. Raidl, 2017, MOD.

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Markus Leitner, Günther R. Raidl, 2011, J. Math. Model. Algorithms.

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem

Günther R. Raidl, Ivana Ljubic, 2001, EvoWorkshops.

A memetic algorithm for the virtual network mapping problem

Günther R. Raidl, Johannes Inführ, G. Raidl, 2016, J. Heuristics.

Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem

Markus Leitner, Günther R. Raidl, Mario Ruthmair, 2011, INOC.

A branch-and-cut-and-price algorithm for a fingerprint-template compression application

Günther R. Raidl, Andreas M. Chwatal, Karin Oberlechner, 2011, 2011 Federated Conference on Computer Science and Information Systems (FedCSIS).

Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers

Günther R. Raidl, Nikolaus Frohner, 2019, LOD.

Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Bryant A. Julstrom, Günther R. Raidl, G. Raidl, 2003, SAC '03.

GECCO ’14: Proceedings of the 2014 conference on Genetic and evolutionary computation

Julian Togelius, Christine Zarges, Hitoshi Iba, 2014 .

Hybrid metaheuristics in combinatorial optimization: A survey

Christian Blum, Andrea Roli, Günther R. Raidl, 2011, Appl. Soft Comput..

Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations

Günther R. Raidl, Bin Hu, Petrina Papazek, 2013, Hybrid Metaheuristics.

Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering

Günther R. Raidl, Bin Hu, 2006 .

An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure

Andreas Schöbel, Günther R. Raidl, Gerhard Besau, 2013 .

An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem

Günther R. Raidl, Bin Hu, G. Raidl, 2012, GECCO '12.

An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem

Günther R. Raidl, Gabriele Koller, 2004, PPSN.

Biased mutation operators for subgraph-selection problems

Bryant A. Julstrom, Günther R. Raidl, Gabriele Koller, 2006, IEEE Transactions on Evolutionary Computation.

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing

Stefano Cagnoni, Pier Luca Lanzi, Günther R. Raidl, 2001 .

Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search

Markus Leitner, Günther R. Raidl, Bin Hu, 2005 .

Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Günther R. Raidl, Jens Gottlieb, G. Raidl, 2005, Evolutionary Computation.

Letting ants labeling point features [sic.: for 'labeling' read 'label']

Günther R. Raidl, M. Schreyer, 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control

Günther R. Raidl, Christian Kloimüllner, Bong-Min Kim, 2017, EvoCOP.

Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques

Günther R. Raidl, Sandro Pirkwieser, 2009 .

Models and algorithms for three-stage two-dimensional bin packing

Günther R. Raidl, Jakob Puchinger, G. Raidl, 2007, Eur. J. Oper. Res..

MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics

Günther R. Raidl, Jakob Puchinger, Sandro Pirkwieser, 2010, Matheuristics.

Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem

Markus Leitner, Günther R. Raidl, Bin Hu, 2008, J. Heuristics.

Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem

Günther R. Raidl, Christian Kloimüllner, G. Raidl, 2017, LION.

An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem

Günther R. Raidl, Thomas Hackl, Johannes Maschler, 2017 .

An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows

Günther R. Raidl, Elina Rönnberg, Matthias Horn, 2018 .

A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents

Matthias Prandtstetter, Günther R. Raidl, Christian Schauer, 2010, Hybrid Metaheuristics.

Models and algorithms for competitive facility location problems with different customer behavior

Günther R. Raidl, Benjamin Biesinger, Bin Hu, 2016, Annals of Mathematics and Artificial Intelligence.

GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem

Günther R. Raidl, Johannes Inführ, G. Raidl, 2013, Hybrid Metaheuristics.

A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems

Günther R. Raidl, Bin Hu, Christian Kloimüllner, 2015, EUROCAST.

A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse

Matthias Prandtstetter, Günther R. Raidl, Thomas Misar, 2009, EvoCOP.

Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem

Günther R. Raidl, Matthias Horn, 2019, EUROCAST.

Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges

Bryant A. Julstrom, Günther R. Raidl, G. Raidl, 2002, SAC '02.

Finding Longest Common Subsequences: New anytime A∗ search results

Günther R. Raidl, Christian Blum, Marko Djukanovic, 2020, Appl. Soft Comput..

Solving the post enrolment course timetabling problem by ant colony optimization

Günther R. Raidl, Alfred Mayer, Clemens Nothegger, 2012, Ann. Oper. Res..

Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms

Günther R. Raidl, Andreas M. Chwatal, 2009, EUROCAST.

On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences

Günther R. Raidl, Christian Blum, Matthias Horn, 2020, OPTIMA.

Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints

Günther R. Raidl, Johannes Inführ, G. Raidl, 2011, INOC.

Speeding Up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem

Günther R. Raidl, Bin Hu, Thomas Baumhauer, 2014, Hybrid Metaheuristics.

A Timeslot-Filling Heuristic Approach to Construct High-School Timetables

Günther R. Raidl, Michael Pimmer, G. Raidl, 2013 .

A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem

Günther R. Raidl, Johannes Maschler, 2015, OR.

Günther R. Raidl, Josef Schiefer, Martin Suntinger, 2010, RCIS 2010.

Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach

Günther R. Raidl, Bin Hu, Petrina Papazek, 2013, EvoCOP.

Finding Smooth Graphs with Small Independence Numbers

Günther R. Raidl, Herbert Fleischner, Benedikt Klocker, 2017, MOD.

Combining Forces to Reconstruct Strip Shredded Text Documents

Matthias Prandtstetter, Günther R. Raidl, G. Raidl, 2008, Hybrid Metaheuristics.

Automatic Generation of 2-AntWars Players with Genetic Programming

Günther R. Raidl, Johannes Inführ, G. Raidl, 2011, EUROCAST.

A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications

Günther R. Raidl, Tobias Rodemann, Thomas Jatschka, 2019, EvoCOP.

An improved hybrid genetic algorithm for the generalized assignment problem

Günther R. Raidl, Harald Feltl, G. Raidl, 2004, SAC '04.

Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search

Günther R. Raidl, Frederico Dusberger, 2015, Electron. Notes Discret. Math..

An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem

Matthias Prandtstetter, Günther R. Raidl, G. Raidl, 2008, Eur. J. Oper. Res..

Evolutionary computation and optimization track: SAC 2002

Günther R. Raidl, Roger L. Wainwright, 2002, SAC '02.

VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points

Günther R. Raidl, Tobias Rodemann, Thomas Jatschka, 2019, EUROCAST.

Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization

Günther R. Raidl, Jakob Puchinger, G. Raidl, 2008, Hybrid Metaheuristics.

Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure

Andreas Schöbel, Günther R. Raidl, Igor Grujicic, 2015, Electron. Notes Discret. Math..

A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems

Günther R. Raidl, Bin Hu, Petrina Papazek, 2013, EUROCAST.

A SAT Approach for Finding Sup-Transition-Minors

Günther R. Raidl, Herbert Fleischner, Benedikt Klocker, 2019, LION.

A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands

Günther R. Raidl, Benjamin Biesinger, Bin Hu, 2015, EvoCOP.

On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi Layer Hierarchical Ring Network Design Problem

Günther R. Raidl, Christian Schauer, 2015, EUROCAST.

Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem

Günther R. Raidl, Jakob Puchinger, Sandro Pirkwieser, 2007, EvoCOP.

Particle therapy patient scheduling with limited starting time variations of daily treatments

Günther R. Raidl, Johannes Maschler, G. Raidl, 2018, Int. Trans. Oper. Res..

Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search

Günther R. Raidl, Bin Hu, Thomas Baumhauer, 2015, Electron. Notes Discret. Math..

The Core Concept for the Multidimensional Knapsack Problem

Günther R. Raidl, Ulrich Pferschy, Jakob Puchinger, 2006, EvoCOP.

Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem

Günther R. Raidl, Andrea Rendl, Alan Tus, 2015, LION.

Effective Neighborhood Structures for the Generalized Traveling Salesman Problem

Günther R. Raidl, Bin Hu, G. Raidl, 2008, EvoCOP.

Günther R. Raidl, Tobias Rodemann, Thomas Jatschka, 2019, LOD.

An A ∗ Search Algorithm for the Constrained Longest Common Subsequence Problem

Günther R. Raidl, Christian Blum, Christoph Berger, 2020 .

An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem

Günther R. Raidl, Bin Hu, G. Raidl, 2011, EUROCAST.

A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem

Matthias Prandtstetter, Günther R. Raidl, G. Raidl, 2005 .

New developments in metaheuristics and their applications

Pascal Van Hentenryck, Hoong Chuin Lau, Günther R. Raidl, 2016, J. Heuristics.

The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search

Günther R. Raidl, Jens Gottlieb, 2000, GECCO.

Edge sets: an effective evolutionary coding of spanning trees

Bryant A. Julstrom, Günther R. Raidl, G. Raidl, 2003, IEEE Trans. Evol. Comput..

A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems

Günther R. Raidl, Bin Hu, Petrina Papazek, 2013 .

Driver Shift Planning for an Online Store with Short Delivery Times

Günther R. Raidl, Matthias Horn, Nikolaus Frohner, 2021 .

A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications

Günther R. Raidl, Tobias Rodemann, Thomas Jatschka, 2021, Algorithms.

A*-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem

Günther R. Raidl, Matthias Horn, G. Raidl, 2021, CPAIOR.

Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems

Günther R. Raidl, Nikolaus Frohner, Adrian Bracher, 2021, CPAIOR.

Fingerprint Template Compression by Solving a Minimum Label k‐Node Subtree Problem

Günther R. Raidl, Andreas M. Chwatal, G. Raidl, 2007 .

A Lagrangian Relax‐and‐Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Günther R. Raidl, Martin Gruber, 2008 .

Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem

Markus Leitner, Günther R. Raidl, Bin Hu, 2007 .

A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks

Petra Mutzel, Günther R. Raidl, Ulrich Pferschy, 2007 .

Branch-and-Price for a Survivable Network Design Problem

Markus Leitner, Günther R. Raidl, Ulrich Pferschy, 2010 .

A Memetic Algorithm for the Partition Graph Coloring Problem

Petrica C. Pop, Günther R. Raidl, Bin Hu, 2013 .

On Stabilized Branch-and-Price for Constrained Tree Problems

Markus Leitner, Günther R. Raidl, Mario Ruthmair, 2011 .

A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows 1

Günther R. Raidl, Sandro Pirkwieser, G. Raidl, 2009 .

Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem

Günther R. Raidl, Jakob Puchinger, G. Raidl, 2005 .

Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem

Markus Leitner, Günther R. Raidl, Mario Ruthmair, 2011 .