Skillful Genotype Decoding in EAs for Solving the Cutting Problem. - Günther R. Raidl (Evolutionary Programming, 1996)

Finding a perceptual uniform color space with evolution strategies. - Günther R. Raidl; Ingeborg Tastl (ICEC, 1997)

Transforming an analytically defined color space to match psychophysically gained color distances. - Ingeborg Tastl; Günther R. Raidl (Color Imaging: Device-Independent Color, Color Hardcopy, and Graphic Arts, 1998)

Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks. - Günther R. Raidl; Gabriele Kodydek (NC, 1998)

Genetic Algorithms for the Multiple Container Packing Problem. - Günther R. Raidl; Gabriele Kodydek (PPSN, 1998)

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

Weight-codings in a genetic algorithm for the multi-constraint knapsack problem. - Günther R. Raidl (CEC, 1999)

A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem. - Günther R. Raidl (SAC, 1999)

An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. - Günther R. Raidl (CEC, 2000)

The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search. - Jens Gottlieb; Günther R. Raidl (GECCO, 2000)

A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. - Ivana Ljubic; Günther R. Raidl; Jozef Kratica (PPSN, 2000)

A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. - Günther R. Raidl; Bryant A. Julstrom (SAC (1), 2000)

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

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

Evolutionary computation and optimization track. - Roger L. Wainwright; Günther R. Raidl (SAC, 2001)

Letting ants labeling point features [sic.: for 'labeling' read 'label']. - Michael Schreyer; Günther R. Raidl (IEEE Congress on Evolutionary Computation, 2002)

A Memetic Algorithm for Vertex-Biconnectivity Augmentation. - Sandor Kersting; Günther R. Raidl; Ivana Ljubic (EvoWorkshops, 2002)

On Weight-Biased Mutation for Graph Problems. - Günther R. Raidl; Gabriele Kodydek; Bryant A. Julstrom (PPSN, 2002)

Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. - Bryant A. Julstrom; Günther R. Raidl (SAC, 2002)

Evolutionary computation and optimization track: SAC 2002. - Roger L. Wainwright; Günther R. Raidl (SAC, 2002)

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

Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. - Günther R. Raidl; Bryant A. Julstrom (SAC, 2003)

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

Edge sets: an effective evolutionary coding of spanning trees. - Günther R. Raidl; Bryant A. Julstrom (IEEE Trans. Evol. Comput., 2003)

Solving a Real-World Glass Cutting Problem. - Jakob Puchinger; Günther R. Raidl; Gabriele Koller (EvoCOP, 2004)

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. - Gunnar W. Klau; Ivana Ljubic; Andreas Moser; Petra Mutzel; Philipp Neuner; Ulrich Pferschy; Günther R. Raidl; René Weiskircher (GECCO (1), 2004)

An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem. - Gabriele Koller; Günther R. Raidl (PPSN, 2004)

An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. - Jakob Puchinger; Günther R. Raidl (PPSN, 2004)

An improved hybrid genetic algorithm for the generalized assignment problem. - Harald Feltl; Günther R. Raidl (SAC, 2004)

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

Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. - Jakob Puchinger; Günther R. Raidl (IWINAC (2), 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 (Evol. Comput., 2005)

The Core Concept for the Multidimensional Knapsack Problem. - Jakob Puchinger; Günther R. Raidl; Ulrich Pferschy (EvoCOP, 2006)

Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. - Martin Gruber; Jano I. van Hemert; Günther R. Raidl (GECCO, 2006)

A Unified View on Hybrid Metaheuristics. - Günther R. Raidl (Hybrid Metaheuristics, 2006)

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. - Daniel Wagner; Günther R. Raidl; Ulrich Pferschy; Petra Mutzel; Peter Bachhiesl (OR, 2006)

Biased Mutation Operators for Subgraph-Selection Problems. - Günther R. Raidl; Gabriele Koller; Bryant A. Julstrom (IEEE Trans. Evol. Comput., 2006)

Determining Orbital Elements of Extrasolar Planets by Evolution Strategies. - Andreas M. Chwatal; Günther R. Raidl (EUROCAST, 2007)

Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. - Sandro Pirkwieser; Günther R. Raidl; Jakob Puchinger (EvoCOP, 2007)

Models and algorithms for three-stage two-dimensional bin packing. - Jakob Puchinger; Günther R. Raidl (Eur. J. Oper. Res., 2007)

Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. - Bin Hu 004; Günther R. Raidl (EvoCOP, 2008)

Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. - Sandro Pirkwieser; Günther R. Raidl (GECCO, 2008)

Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem. - Bin Hu 004; Günther R. Raidl (HIS, 2008)

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. - Markus Leitner; Günther R. Raidl (Hybrid Metaheuristics, 2008)

Combining Forces to Reconstruct Strip Shredded Text Documents. - Matthias Prandtstetter; Günther R. Raidl (Hybrid Metaheuristics, 2008)

Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. - Martin Gruber; Günther R. Raidl (SAINT, 2008)

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

An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. - Matthias Prandtstetter; Günther R. Raidl (Eur. J. Oper. Res., 2008)

Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. - Bin Hu 004; Markus Leitner; Günther R. Raidl (J. Heuristics, 2008)

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

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. - Sandro Pirkwieser; Günther R. Raidl; Jakob Puchinger (Recent Advances in Evolutionary Computation for Combinatorial Optimization, 2008)

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

Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms. - Andreas M. Chwatal; Günther R. Raidl (EUROCAST, 2009)

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

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

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

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

Meta-heuristics for reconstructing cross cut shredded text documents. - Matthias Prandtstetter; Günther R. Raidl (GECCO, 2009)

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

Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows. - Sandro Pirkwieser; Günther R. Raidl (Hybrid Metaheuristics, 2009)

Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search. - Jakob Walla; Mario Ruthmair; Günther R. Raidl (Hybrid Metaheuristics, 2009)

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

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

Multilevel Variable Neighborhood Search for Periodic Routing Problems. - Sandro Pirkwieser; Günther R. Raidl (EvoCOP, 2010)

Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive. - Günther R. Raidl; Bin Hu 004 (EvoCOP, 2010)

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

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

Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem. - Sandro Pirkwieser; Günther R. Raidl (Hybrid Metaheuristics, 2010)

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

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

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

Similarity Searching in Sequences of Complex Events. - Hannes Obweger; Martin Suntinger; Josef Schiefer; Günther R. Raidl (RCIS, 2010)

Strong Lower Bounds for a Survivable Network Design Problem. - Markus Leitner; Günther R. Raidl (Electron. Notes Discret. Math., 2010)

The Multidimensional Knapsack Problem: Structure and Algorithms. - Jakob Puchinger; Günther R. Raidl; Ulrich Pferschy (INFORMS J. Comput., 2010)

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

(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 (Matheuristics, 2010)

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

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

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

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

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

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

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

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

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

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

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

Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques. - Andreas M. Chwatal; Günther R. Raidl (Adv. Oper. Res., 2011)

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

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

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

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

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

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

On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem. - Mario Ruthmair; Günther R. Raidl (ISCO, 2012)

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

Solving the post enrolment course timetabling problem by ant colony optimization. - Clemens Nothegger; Alfred Mayer; Andreas M. Chwatal; Günther R. Raidl (Ann. Oper. Res., 2012)

Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents. - Benjamin Biesinger; Christian Schauer; Bin Hu 004; Günther R. Raidl (EUROCAST (1), 2013)

A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems. - Petrina Papazek; Günther R. Raidl; Marian Rainer-Harbach; Bin Hu 004 (EUROCAST (1), 2013)

A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. - Petrica C. Pop; Bin Hu 004; Günther R. Raidl (EUROCAST (1), 2013)

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

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

GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem. - Johannes Inführ; Günther R. Raidl (Hybrid Metaheuristics, 2013)

Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations. - Günther R. Raidl; Bin Hu 004; Marian Rainer-Harbach; Petrina Papazek (Hybrid Metaheuristics, 2013)

Using Optimized Virtual Network Embedding for Network Dimensioning. - Johannes Inführ; David Stezenbach; Matthias Hartmann; Kurt Tutschku; Günther R. Raidl (NetSys, 2013)

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

Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles. - Christopher Bacher; Thorsten Krenek; Günther R. Raidl (EvoApplications, 2014)

Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. - Christian Kloimüllner; Petrina Papazek; Bin Hu 004; Günther R. Raidl (EvoCOP, 2014)

A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. - Frederico Dusberger; Günther R. Raidl (Hybrid Metaheuristics, 2014)

Speeding Up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem. - Günther R. Raidl; Thomas Baumhauer; Bin Hu 004 (Hybrid Metaheuristics, 2014)

An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior. - Benjamin Biesinger; Bin Hu 004; Günther R. Raidl (LION, 2014)

Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid. - Petrina Papazek; Christian Kloimüllner; Bin Hu 004; Günther R. Raidl (PPSN, 2014)

A Memetic Algorithm for Multi Layer Hierarchical Ring Network Design. - Christian Schauer; Günther R. Raidl (PPSN, 2014)

A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles. - Christopher Bacher; Günther R. Raidl; Thorsten Krenek (EUROCAST, 2015)

A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size. - Frederico Dusberger; Günther R. Raidl (EUROCAST, 2015)

A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems. - Christian Kloimüllner; Petrina Papazek; Bin Hu 004; Günther R. Raidl (EUROCAST, 2015)

CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem. - David Markvica; Christian Schauer; Günther R. Raidl (EUROCAST, 2015)

On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi Layer Hierarchical Ring Network Design Problem. - Christian Schauer; Günther R. Raidl (EUROCAST, 2015)

Heuristic Approaches for the Probabilistic Traveling Salesman Problem. - Christoph Weiler; Benjamin Biesinger; Bin Hu 004; Günther R. Raidl (EUROCAST, 2015)

A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands. - Benjamin Biesinger; Bin Hu 004; Günther R. Raidl (EvoCOP, 2015)

A New Solution Representation for the Firefighter Problem. - Bin Hu 004; Andreas Windbichler; Günther R. Raidl (EvoCOP, 2015)

On solving the most strings with few bad columns problem: An ILP model and heuristics. - Evelia Lizárraga; Maria J. Blesa; Christian Blum 001; Günther R. Raidl (INISTA, 2015)

Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem. - Alan Tus; Andrea Rendl; Günther R. Raidl (LION, 2015)

A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem. - Frederico Dusberger; Günther R. Raidl (OR, 2015)

A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem. - Johannes Maschler; Günther R. Raidl (OR, 2015)

Metaheuristics for solving a multimodal home-healthcare scheduling problem. - Gerhard Hiermann; Matthias Prandtstetter; Andrea Rendl; Jakob Puchinger; Günther R. Raidl (Central Eur. J. Oper. Res., 2015)

Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search. - Frederico Dusberger; Günther R. Raidl (Electron. Notes Discret. Math., 2015)

Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure. - Igor Grujicic; Günther R. Raidl; Andreas Schöbel (Electron. Notes Discret. Math., 2015)

Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search. - Günther R. Raidl; Thomas Baumhauer; Bin Hu 004 (Electron. Notes Discret. Math., 2015)

Decomposition based hybrid metaheuristics. - Günther R. Raidl (Eur. J. Oper. Res., 2015)

A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem. - Benjamin Biesinger; Bin Hu 004; Günther R. Raidl (J. Heuristics, 2015)

PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. - Marian Rainer-Harbach; Petrina Papazek; Günther R. Raidl; Bin Hu 004; Christian Kloimüllner (J. Glob. Optim., 2015)

Hybrid Metaheuristics - Powerful Tools for Optimization - Christian Blum 001; Günther R. Raidl (Springer, 2016)

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. - Benedikt Klocker; Herbert Fleischner; Günther R. Raidl (HM, 2016)

Districting and Routing for Security Control. - Michael Prischink; Christian Kloimüllner; Benjamin Biesinger; Günther R. Raidl (HM, 2016)

Models and algorithms for competitive facility location problems with different customer behavior. - Benjamin Biesinger; Bin Hu 004; Günther R. Raidl (Ann. Math. Artif. Intell., 2016)

An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands. - Benjamin Biesinger; Bin Hu 004; Günther R. Raidl (Electron. Notes Discret. Math., 2016)

A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design. - Christian Schauer; Günther R. Raidl (Electron. Notes Discret. Math., 2016)

A memetic algorithm for the virtual network mapping problem. - Johannes Inführ; Günther R. Raidl (J. Heuristics, 2016)

New developments in metaheuristics and their applications - Selected extended contributions from the 10th Metaheuristics International Conference (MIC 2013). - Hoong Chuin Lau; Günther R. Raidl; Pascal Van Hentenryck (J. Heuristics, 2016)

Computational performance evaluation of two integer linear programming models for the minimum common string partition problem. - Christian Blum 001; Günther R. Raidl (Optim. Lett., 2016)

GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection. - Airam Expósito; Günther R. Raidl; Julio Brito; José A. Moreno-Pérez (EUROCAST (1), 2017)

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging. - Benedikt Klocker; Günther R. Raidl (EUROCAST (1), 2017)

Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments. - Johannes Maschler; Martin Riedler; Günther R. Raidl (EUROCAST (1), 2017)

Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control. - Bong-Min Kim; Christian Kloimüllner; Günther R. Raidl (EvoCOP, 2017)

Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem. - Christian Kloimüllner; Günther R. Raidl (LION, 2017)

Refining Partial Invalidations for Indexed Algebraic Dynamic Programming. - Christopher Bacher; Günther R. Raidl (MOD, 2017)

Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment. - Matthias Horn; Günther R. Raidl; Christian Blum 001 (MOD, 2017)

Finding Smooth Graphs with Small Independence Numbers. - Benedikt Klocker; Herbert Fleischner; Günther R. Raidl (MOD, 2017)

Full-load route planning for balancing bike sharing systems by logic-based benders decomposition. - Christian Kloimüllner; Günther R. Raidl (Networks, 2017)

Large neighborhood search for the most strings with few bad columns problem. - Evelia Lizárraga; Maria J. Blesa; Christian Blum 001; Günther R. Raidl (Soft Comput., 2017)

Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. - Marko Djukanovic; Günther R. Raidl; Christian Blum 001 (LION, 2018)

Solving a selective dial-a-ride problem with logic-based Benders decomposition. - Martin Riedler; Günther R. Raidl (Comput. Oper. Res., 2018)

A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands. - Benjamin Biesinger; Bin Hu 004; Günther R. Raidl (Transp. Sci., 2018)

A Memetic Algorithm for Competitive Facility Location Problems. - Benjamin Biesinger; Bin Hu 004; Günther R. Raidl (Business and Consumer Analytics: New Ideas, 2019)

A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem. - Christian Blum 001; Dhananjay R. Thiruvady; Andreas T. Ernst; Matthias Horn; Günther R. Raidl (Australasian Conference on Artificial Intelligence, 2019)

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. - Marko Djukanovic; Günther R. Raidl; Christian Blum 001 (EUROCAST (1), 2019)

Casual Employee Scheduling with Constraint Programming and Metaheuristics. - Nikolaus Frohner; Stephan Teuschl; Günther R. Raidl (EUROCAST (1), 2019)

Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem. - Matthias Horn; Günther R. Raidl (EUROCAST (1), 2019)

VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points. - Thomas Jatschka; Tobias Rodemann; Günther R. Raidl (EUROCAST (1), 2019)

A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. - Thomas Jatschka; Tobias Rodemann; Günther R. Raidl (EvoCOP, 2019)

Strategies for Iteratively Refining Layered Graph Models. - Martin Riedler; Mario Ruthmair; Günther R. Raidl (HM, 2019)

Towards Improving Merging Heuristics for Binary Decision Diagrams. - Nikolaus Frohner; Günther R. Raidl (LION, 2019)

A SAT Approach for Finding Sup-Transition-Minors. - Benedikt Klocker; Herbert Fleischner; Günther R. Raidl (LION, 2019)

A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems. - Christian Kloimüllner; Günther R. Raidl (LION, 2019)

A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. - Marko Djukanovic; Günther R. Raidl; Christian Blum 001 (LOD, 2019)

Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers. - Nikolaus Frohner; Günther R. Raidl (LOD, 2019)

Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. - Thomas Jatschka; Tobias Rodemann; Günther R. Raidl (LOD, 2019)

Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm. - Matthias Horn; Günther R. Raidl; Christian Blum 001 (Artif. Intell., 2019)

A Beam Search Approach to the Traveling Tournament Problem. - Nikolaus Frohner; Bernhard Neumann; Günther R. Raidl (EvoCOP, 2020)

Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines⁎. - Nikolaus Frohner; Matthias Horn; Günther R. Raidl (ISM, 2020)

Driver Shift Planning for an Online Store with Short Delivery Times. - Matthias Horn; Nikolaus Frohner; Günther R. Raidl (ISM, 2020)

On Solving a Generalized Constrained Longest Common Subsequence Problem. - Marko Djukanovic; Christoph Berger; Günther R. Raidl; Christian Blum 001 (OPTIMA, 2020)

On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. - Matthias Horn; Marko Djukanovic; Christian Blum 001; Günther R. Raidl (OPTIMA, 2020)

Distributing Battery Swapping Stations for Electric Scooters in an Urban Area. - Thomas Jatschka; Fabio F. Oberweger; Tobias Rodemann; Günther R. Raidl (OPTIMA, 2020)

A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem. - Thomas Kaufmann; Matthias Horn; Günther R. Raidl (PPSN (2), 2020)

A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three. - Benedikt Klocker; Herbert Fleischner; Günther R. Raidl (Appl. Math. Comput., 2020)

Finding Longest Common Subsequences: New anytime A∗ search results. - Marko Djukanovic; Günther R. Raidl; Christian Blum 001 (Appl. Soft Comput., 2020)

Anytime algorithms for the longest common palindromic subsequence problem. - Marko Djukanovic; Günther R. Raidl; Christian Blum 001 (Comput. Oper. Res., 2020)

A model for finding transition-minors. - Benedikt Klocker; Herbert Fleischner; Günther R. Raidl (Discret. Appl. Math., 2020)

Particle therapy patient scheduling with limited starting time variations of daily treatments. - Johannes Maschler; Günther R. Raidl (Int. Trans. Oper. Res., 2020)

An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem. - Martin Riedler; Thomas Jatschka; Johannes Maschler; Günther R. Raidl (Int. Trans. Oper. Res., 2020)

Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems. - Adrian Bracher; Nikolaus Frohner; Günther R. Raidl (CPAIOR, 2021)

A*-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem. - Matthias Horn; Günther R. Raidl (CPAIOR, 2021)

Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems. - Marc Huber; Günther R. Raidl (LOD, 2021)

A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. - Thomas Jatschka; Günther R. Raidl; Tobias Rodemann (Algorithms, 2021)

A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources. - Matthias Horn; Günther R. Raidl; Elina Rönnberg (Ann. Oper. Res., 2021)

Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources. - Johannes Maschler; Günther R. Raidl (Ann. Oper. Res., 2021)

Solving longest common subsequence problems via a transformation to the maximum clique problem. - Christian Blum 001; Marko Djukanovic; Alberto Santini; Hua Jiang; Chu-Min Li 001; Felip Manyà; Günther R. Raidl (Comput. Oper. Res., 2021)

A∗-based construction of decision diagrams for a prize-collecting scheduling problem. - Matthias Horn; Johannes Maschler; Günther R. Raidl; Elina Rönnberg (Comput. Oper. Res., 2021)

An A⁎ search algorithm for the constrained longest common subsequence problem. - Marko Djukanovic; Christoph Berger; Günther R. Raidl; Christian Blum 001 (Inf. Process. Lett., 2021)

A Learning Large Neighborhood Search for the Staff Rerostering Problem. - Fabio F. Oberweger; Günther R. Raidl; Elina Rönnberg; Marc Huber (CPAIOR, 2022)

A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem. - Marc Huber; Günther R. Raidl (EUROCAST, 2022)

A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters. - Thomas Jatschka; Matthias Rauscher; Bernhard Kreutzer; Yusuke Okamoto; Hiroaki Kataoka; Tobias Rodemann; Günther R. Raidl (EUROCAST, 2022)

A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation. - Jonas Mayerhofer; Markus Kirchweger; Marc Huber; Günther R. Raidl (EvoCOP, 2022)

Parallel Beam Search for Combinatorial Optimization. - Nikolaus Frohner; Jan Gmys; Nouredine Melab; Günther R. Raidl; El-Ghazali Talbi (ICPP Workshops, 2022)

Parallel Beam Search for Combinatorial Optimization (Extended Abstract). - Nikolaus Frohner; Jan Gmys; Nouredine Melab; Günther R. Raidl; El-Ghazali Talbi (SOCS, 2022)

Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet. - Johannes Varga; Günther R. Raidl; Steffen Limmer (IEEE Access, 2022)

Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. - Marko Djukanovic; Aleksandar Kartelj; Dragan Matic; Milana Grbic; Christian Blum 001; Günther R. Raidl (Appl. Soft Comput., 2022)

HyMeHeu-solver - A Hybrid Metaheuristic Solver for the Directed Feedback Vertex Set Problem. - Maria Bresich; Günther R. Raidl; Johannes Varga (Zenodo, 2022)

A Policy-Based Learning Beam Search for Combinatorial Optimization. - Rupert Ettrich; Marc Huber; Günther R. Raidl (EvoCOP, 2023)

A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning. - Thomas Jatschka; Tobias Rodemann; Günther R. Raidl (EvoCOP, 2023)

An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles. - Steffen Limmer; Johannes Varga; Günther R. Raidl (EvoApplications@EvoStar, 2023)

Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines. - Nikolaus Frohner; Günther R. Raidl; Francisco Chicano (GECCO Companion, 2023)

Speeding Up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks. - Johannes Varga; Emil Karlsson; Günther R. Raidl; Elina Rönnberg; Fredrik Lindsten; Tobias Rodemann (LOD (1), 2023)

Interactive Job Scheduling with Partially Known Personnel Availabilities. - Johannes Varga; Günther R. Raidl; Elina Rönnberg; Tobias Rodemann (OLA, 2023)

Approaching the Traveling Tournament Problem with Randomized Beam Search. - Nikolaus Frohner; Bernhard Neumann; Giulio Pace; Günther R. Raidl (Evol. Comput., 2023)

Improvements in Large Neighborhood Search for the Electric Autonomous Dial-A-Ride Problem. - Maria Bresich; Günther R. Raidl; Steffen Limmer (EUROCAST (1), 2024)

Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime. - Nikolaus Frohner; Günther R. Raidl (EUROCAST (1), 2024)

Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding. - Marc Huber; Günther R. Raidl; Christian Blum 001 (EUROCAST (1), 2024)

Tackling the α-Domination Problem Heuristically. - Enrico Iurlano; Johannes Varga; Günther R. Raidl (EUROCAST (1), 2024)

A Learning Twolevel Optimization Approach for the Demand Maximizing Battery Swapping Station Location Problem. - Laurenz Tomandl; Thomas Jatschka; Günther R. Raidl; Tobias Rodemann (EUROCAST (1), 2024)

Selecting User Queries in Interactive Job Scheduling. - Johannes Varga; Günther R. Raidl; Tobias Rodemann (EUROCAST (1), 2024)

A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem. - Jaume Reixach; Christian Blum 001; Marko Djukanovic; Günther R. Raidl (EvoStar, 2024)

Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion. - Maria Bresich; Günther R. Raidl; Steffen Limmer (GECCO, 2024)

Evolutionary Computation meets Machine Learning for Combinatorial Optimisation. - Yi Mei 001; Günther R. Raidl (GECCO Companion, 2024)

Signed double Roman domination on cubic graphs. - Enrico Iurlano; Tatjana Zec; Marko Djukanovic; Günther R. Raidl (Appl. Math. Comput., 2024)

Scheduling jobs using queries to interactively learn human availability times. - Johannes Varga; Günther R. Raidl; Elina Rönnberg; Tobias Rodemann (Comput. Oper. Res., 2024)

SAT-Based Search for Minwise Independent Families. - Enrico Iurlano; Günther R. Raidl (CoRR, 2024)

Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem. - William Huang; Yi Mei 001; Günther R. Raidl; Fangfang Zhang 003; Laurenz Tomandl; Steffen Limmer; Mengjie Zhang 001; Tobias Rodemann (CEC, 2025)

A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem. - Jaume Reixach; Christian Blum 001; Marko Djukanovic; Günther R. Raidl (IEEE Trans. Evol. Comput., 2025)