Günther R. Raidl

237 papers A 16B 37C 9Misc 7Journal 61Unranked 96

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	A Denoising Diffusion Adaptive Search for the α-Domination Problem on Social Graphs. EvoCOP Martin Wustinger, Enrico Iurlano, Günther R. Raidl
2026	J	`jnl`	Exact methods for the Selective Assessment Routing Problem. Central Eur. J. Oper. Res. Joan Salvà Soler, Vera C. Hemmelmayr, Günther R. Raidl
2025	J	`jnl`	A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem. IEEE Trans. Evol. Comput. Jaume Reixach, Christian Blum, Marko Djukanovic, Günther R. Raidl
2025	J	`jnl`	A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independent Set Problem. CoRR Joan Salvà Soler, Günther R. Raidl
2025	A	`conf`	A Hybrid CMSA-Column Generation Approach to Variable-Sized Bin Packing. ECAI Mehmet Anil Akbay, Christian Blum, Günther R. Raidl
2025	J	`jnl`	An Adaptive CMSA for Solving the Longest Filled Common Subsequence Problem with an Application in Audio Querying. CoRR Marko Djukanovic, Christian Blum, Aleksandar Kartelj, Ana Nikolikj, Günther R. Raidl
2025	B	`conf`	Complexity of Positive Influence Domination on Partial Grids. FCT Enrico Iurlano, Günther R. Raidl
2025	—	`conf`	Evolutionary Computation meets Machine Learning for Combinatorial Optimisation. GECCO Companion Yi Mei, Günther R. Raidl
2025	B	`conf`	Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem. CEC William Huang, Yi Mei, Günther R. Raidl, Fangfang Zhang, Laurenz Tomandl, Steffen Limmer, Mengjie Zhang, Tobias Rodemann
2024	—	`conf`	A Learning Twolevel Optimization Approach for the Demand Maximizing Battery Swapping Station Location Problem. EUROCAST (1) Laurenz Tomandl, Thomas Jatschka, Günther R. Raidl, Tobias Rodemann
2024	—	`conf`	A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem. EvoStar Jaume Reixach, Christian Blum, Marko Djukanovic, Günther R. Raidl
2024	—	`conf`	Evolutionary Computation meets Machine Learning for Combinatorial Optimisation. GECCO Companion Yi Mei, Günther R. Raidl
2024	—	`conf`	Improvements in Large Neighborhood Search for the Electric Autonomous Dial-A-Ride Problem. EUROCAST (1) Maria Bresich, Günther R. Raidl, Steffen Limmer
2024	—	`conf`	Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime. EUROCAST (1) Nikolaus Frohner, Günther R. Raidl
2024	—	`conf`	Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding. EUROCAST (1) Marc Huber, Günther R. Raidl, Christian Blum
2024	A	`conf`	Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion. GECCO Maria Bresich, Günther R. Raidl, Steffen Limmer
2024	J	`jnl`	SAT-Based Search for Minwise Independent Families. CoRR Enrico Iurlano, Günther R. Raidl
2024	J	`jnl`	Scheduling jobs using queries to interactively learn human availability times. Comput. Oper. Res. Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann
2024	—	`conf`	Selecting User Queries in Interactive Job Scheduling. EUROCAST (1) Johannes Varga, Günther R. Raidl, Tobias Rodemann
2024	J	`jnl`	Signed double Roman domination on cubic graphs. Appl. Math. Comput. Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl
2024	—	`conf`	Tackling the α-Domination Problem Heuristically. EUROCAST (1) Enrico Iurlano, Johannes Varga, Günther R. Raidl
2023	B	`conf`	A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning. EvoCOP Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
2023	B	`conf`	A Policy-Based Learning Beam Search for Combinatorial Optimization. EvoCOP Rupert Ettrich, Marc Huber, Günther R. Raidl
2023	—	`conf`	An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles. EvoApplications@EvoStar Steffen Limmer, Johannes Varga, Günther R. Raidl
2023	J	`jnl`	Approaching the Traveling Tournament Problem with Randomized Beam Search. Evol. Comput. Nikolaus Frohner, Bernhard Neumann, Giulio Pace, Günther R. Raidl
2023	—	`conf`	Interactive Job Scheduling with Partially Known Personnel Availabilities. OLA Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann
2023	—	`conf`	Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines. GECCO Companion Nikolaus Frohner, Günther R. Raidl, Francisco Chicano
2023	J	`jnl`	Signed double Roman domination on cubic graphs. CoRR Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl
2023	—	`conf`	Speeding Up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks. LOD (1) Johannes Varga, Emil Karlsson, Günther R. Raidl, Elina Rönnberg, Fredrik Lindsten, Tobias Rodemann
2022	B	`conf`	A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation. EvoCOP Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl
2022	—	`conf`	A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters. EUROCAST Thomas Jatschka, Matthias Rauscher, Bernhard Kreutzer, Yusuke Okamoto, Hiroaki Kataoka, Tobias Rodemann, Günther R. Raidl
2022	B	`conf`	A Learning Large Neighborhood Search for the Staff Rerostering Problem. CPAIOR Fabio Francisco Oberweger, Günther R. Raidl, Elina Rönnberg, Marc Huber
2022	—	`conf`	A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem. EUROCAST Marc Huber, Günther R. Raidl
2022	J	`jnl`	Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet. IEEE Access Johannes Varga, Günther R. Raidl, Steffen Limmer
2022	J	`jnl`	Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Appl. Soft Comput. Marko Djukanovic, Aleksandar Kartelj, Dragan Matic, Milana Grbic, Christian Blum, Günther R. Raidl
2022	B	`conf`	Parallel Beam Search for Combinatorial Optimization (Extended Abstract). SOCS Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi
2022	—	`conf`	Parallel Beam Search for Combinatorial Optimization. ICPP Workshops Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi
2021	B	`conf`	A CPAIOR Matthias Horn, Günther R. Raidl
2021	J	`jnl`	A Comput. Oper. Res. Matthias Horn, Johannes Maschler, Günther R. Raidl, Elina Rönnberg
2021	J	`jnl`	A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. Algorithms Thomas Jatschka, Günther R. Raidl, Tobias Rodemann
2021	J	`jnl`	A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources. Ann. Oper. Res. Matthias Horn, Günther R. Raidl, Elina Rönnberg
2021	J	`jnl`	An A Inf. Process. Lett. Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
2021	—	`conf`	Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems. LOD Marc Huber, Günther R. Raidl
2021	B	`conf`	Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems. CPAIOR Adrian Bracher, Nikolaus Frohner, Günther R. Raidl
2021	J	`jnl`	Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources. Ann. Oper. Res. Johannes Maschler, Günther R. Raidl
2021	J	`jnl`	Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl
2020	B	`conf`	A Beam Search Approach to the Traveling Tournament Problem. EvoCOP Nikolaus Frohner, Bernhard Neumann, Günther R. Raidl
2020	—	`conf`	A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem. PPSN (2) Thomas Kaufmann, Matthias Horn, Günther R. Raidl
2020	J	`jnl`	A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three. Appl. Math. Comput. Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
2020	J	`jnl`	A model for finding transition-minors. Discret. Appl. Math. Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
2020	J	`jnl`	An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem. Int. Trans. Oper. Res. Martin Riedler, Thomas Jatschka, Johannes Maschler, Günther R. Raidl
2020	J	`jnl`	Anytime algorithms for the longest common palindromic subsequence problem. Comput. Oper. Res. Marko Djukanovic, Günther R. Raidl, Christian Blum
2020	—	`conf`	Distributing Battery Swapping Stations for Electric Scooters in an Urban Area. OPTIMA Thomas Jatschka, Fabio Francisco Oberweger, Tobias Rodemann, Günther R. Raidl
2020	C	`conf`	Driver Shift Planning for an Online Store with Short Delivery Times. ISM Matthias Horn, Nikolaus Frohner, Günther R. Raidl
2020	J	`jnl`	Finding Longest Common Subsequences: New anytime A∗ search results. Appl. Soft Comput. Marko Djukanovic, Günther R. Raidl, Christian Blum
2020	—	`conf`	On Solving a Generalized Constrained Longest Common Subsequence Problem. OPTIMA Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
2020	—	`conf`	On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. OPTIMA Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl
2020	J	`jnl`	Particle therapy patient scheduling with limited starting time variations of daily treatments. Int. Trans. Oper. Res. Johannes Maschler, Günther R. Raidl
2020	C	`conf`	Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines ISM Nikolaus Frohner, Matthias Horn, Günther R. Raidl
2019	—	`conf`	A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. LOD Marko Djukanovic, Günther R. Raidl, Christian Blum
2019	—	`conf`	A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem. Australasian Conference on Artificial Intelligence Christian Blum, Dhananjay R. Thiruvady, Andreas T. Ernst, Matthias Horn, Günther R. Raidl
2019	B	`conf`	A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. EvoCOP Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
2019	—	`conf`	A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. EUROCAST (1) Marko Djukanovic, Günther R. Raidl, Christian Blum
2019	—	`ch.`	A Memetic Algorithm for Competitive Facility Location Problems. Business and Consumer Analytics: New Ideas Benjamin Biesinger, Bin Hu, Günther R. Raidl
2019	—	`conf`	A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems. LION Christian Kloimüllner, Günther R. Raidl
2019	—	`conf`	A SAT Approach for Finding Sup-Transition-Minors. LION Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
2019	—	`conf`	Casual Employee Scheduling with Constraint Programming and Metaheuristics. EUROCAST (1) Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl
2019	—	`conf`	Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem. EUROCAST (1) Matthias Horn, Günther R. Raidl
2019	—	`conf`	Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. LOD Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
2019	J	`jnl`	Job sequencing with one common and multiple secondary resources: An A Artif. Intell. Matthias Horn, Günther R. Raidl, Christian Blum
2019	—	`conf`	Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers. LOD Nikolaus Frohner, Günther R. Raidl
2019	—	`conf`	Strategies for Iteratively Refining Layered Graph Models. HM Martin Riedler, Mario Ruthmair, Günther R. Raidl
2019	—	`conf`	Towards Improving Merging Heuristics for Binary Decision Diagrams. LION Nikolaus Frohner, Günther R. Raidl
2019	—	`conf`	VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points. EUROCAST (1) Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
2018	J	`jnl`	A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands. Transp. Sci. Benjamin Biesinger, Bin Hu, Günther R. Raidl
2018	—	`conf`	Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. LION Marko Djukanovic, Günther R. Raidl, Christian Blum
2018	J	`jnl`	Solving a selective dial-a-ride problem with logic-based Benders decomposition. Comput. Oper. Res. Martin Riedler, Günther R. Raidl
2017	B	`conf`	Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control. EvoCOP Bong-Min Kim, Christian Kloimüllner, Günther R. Raidl
2017	—	`conf`	Finding Smooth Graphs with Small Independence Numbers. MOD Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
2017	J	`jnl`	Full-load route planning for balancing bike sharing systems by logic-based benders decomposition. Networks Christian Kloimüllner, Günther R. Raidl
2017	—	`conf`	GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection. EUROCAST (1) Airam Expósito, Günther R. Raidl, Julio Brito, José A. Moreno-Pérez
2017	—	`conf`	Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem. LION Christian Kloimüllner, Günther R. Raidl
2017	—	`conf`	Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment. MOD Matthias Horn, Günther R. Raidl, Christian Blum
2017	J	`jnl`	Large neighborhood search for the most strings with few bad columns problem. Soft Comput. Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl
2017	—	`conf`	Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments. EUROCAST (1) Johannes Maschler, Martin Riedler, Günther R. Raidl
2017	—	`conf`	Refining Partial Invalidations for Indexed Algebraic Dynamic Programming. MOD Christopher Bacher, Günther R. Raidl
2017	—	`conf`	Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging. EUROCAST (1) Benedikt Klocker, Günther R. Raidl
2016	J	`jnl`	A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design. Electron. Notes Discret. Math. Christian Schauer, Günther R. Raidl
2016	J	`jnl`	A memetic algorithm for the virtual network mapping problem. J. Heuristics Johannes Inführ, Günther R. Raidl
2016	J	`jnl`	An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands. Electron. Notes Discret. Math. Benjamin Biesinger, Bin Hu, Günther R. Raidl
2016	J	`jnl`	Computational performance evaluation of two integer linear programming models for the minimum common string partition problem. Optim. Lett. Christian Blum, Günther R. Raidl
2016	—	`conf`	Districting and Routing for Security Control. HM Michael Prischink, Christian Kloimüllner, Benjamin Biesinger, Günther R. Raidl
2016	—	`conf`	Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. HM Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
2016	—	`book`	Hybrid Metaheuristics - Powerful Tools for Optimization Christian Blum, Günther R. Raidl
2016	J	`jnl`	Models and algorithms for competitive facility location problems with different customer behavior. Ann. Math. Artif. Intell. Benjamin Biesinger, Bin Hu, Günther R. Raidl
2016	J	`jnl`	New developments in metaheuristics and their applications - Selected extended contributions from the 10th Metaheuristics International Conference (MIC 2013). J. Heuristics Hoong Chuin Lau, Günther R. Raidl, Pascal Van Hentenryck
2015	—	`conf`	A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems. EUROCAST Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther R. Raidl
2015	—	`conf`	A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem. OR Johannes Maschler, Günther R. Raidl
2015	B	`conf`	A New Solution Representation for the Firefighter Problem. EvoCOP Bin Hu, Andreas Windbichler, Günther R. Raidl
2015	—	`conf`	A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles. EUROCAST Christopher Bacher, Günther R. Raidl, Thorsten Krenek
2015	—	`conf`	A Scalable Approach for the OR Frederico Dusberger, Günther R. Raidl
2015	—	`conf`	A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size. EUROCAST Frederico Dusberger, Günther R. Raidl
2015	B	`conf`	A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands. EvoCOP Benjamin Biesinger, Bin Hu, Günther R. Raidl
2015	J	`jnl`	A hybrid genetic algorithm with solution archive for the discrete (r\|p)-centroid problem. J. Heuristics Benjamin Biesinger, Bin Hu, Günther R. Raidl
2015	J	`jnl`	Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search. Electron. Notes Discret. Math. Günther R. Raidl, Thomas Baumhauer, Bin Hu
2015	—	`conf`	CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem. EUROCAST David Markvica, Christian Schauer, Günther R. Raidl
2015	J	`jnl`	Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem. CoRR Christian Blum, Günther R. Raidl
2015	J	`jnl`	Decomposition based hybrid metaheuristics. Eur. J. Oper. Res. Günther R. Raidl
2015	—	`conf`	Heuristic Approaches for the Probabilistic Traveling Salesman Problem. EUROCAST Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl
2015	J	`jnl`	Metaheuristics for solving a multimodal home-healthcare scheduling problem. Central Eur. J. Oper. Res. Gerhard Hiermann, Matthias Prandtstetter, Andrea Rendl, Jakob Puchinger, Günther R. Raidl
2015	—	`conf`	Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem. LION Alan Tus, Andrea Rendl, Günther R. Raidl
2015	C	`conf`	On solving the most strings with few bad columns problem: An ILP model and heuristics. INISTA Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl
2015	—	`conf`	On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi Layer Hierarchical Ring Network Design Problem. EUROCAST Christian Schauer, Günther R. Raidl
2015	J	`jnl`	PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. J. Glob. Optim. Marian Rainer-Harbach, Petrina Papazek, Günther R. Raidl, Bin Hu, Christian Kloimüllner
2015	J	`jnl`	Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search. Electron. Notes Discret. Math. Frederico Dusberger, Günther R. Raidl
2015	J	`jnl`	Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure. Electron. Notes Discret. Math. Igor Grujicic, Günther R. Raidl, Andreas Schöbel
2014	A	`conf`	A Memetic Algorithm for Multi Layer Hierarchical Ring Network Design. PPSN Christian Schauer, Günther R. Raidl
2014	—	`conf`	A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. Hybrid Metaheuristics Frederico Dusberger, Günther R. Raidl
2014	—	`conf`	An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior. LION Benjamin Biesinger, Bin Hu, Günther R. Raidl
2014	A	`conf`	Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid. PPSN Petrina Papazek, Christian Kloimüllner, Bin Hu, Günther R. Raidl
2014	B	`conf`	Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. EvoCOP Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther R. Raidl
2014	B	`conf`	Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles. EvoApplications Christopher Bacher, Thorsten Krenek, Günther R. Raidl
2014	—	`conf`	Speeding Up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem. Hybrid Metaheuristics Günther R. Raidl, Thomas Baumhauer, Bin Hu
2013	—	`conf`	A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. EUROCAST (1) Petrica C. Pop, Bin Hu, Günther R. Raidl
2013	—	`conf`	A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems. EUROCAST (1) Petrina Papazek, Günther R. Raidl, Marian Rainer-Harbach, Bin Hu
2013	B	`conf`	Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach. EvoCOP Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl
2013	—	`conf`	Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations. Hybrid Metaheuristics Günther R. Raidl, Bin Hu, Marian Rainer-Harbach, Petrina Papazek
2013	—	`conf`	Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents. EUROCAST (1) Benjamin Biesinger, Christian Schauer, Bin Hu, Günther R. Raidl
2013	—	`conf`	GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem. Hybrid Metaheuristics Johannes Inführ, Günther R. Raidl
2013	B	`conf`	Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent. EvoCOP Johannes Inführ, Günther R. Raidl
2013	J	`jnl`	Stabilizing branch-and-price for constrained tree problems. Networks Markus Leitner, Mario Ruthmair, Günther R. Raidl
2013	—	`conf`	Using Optimized Virtual Network Embedding for Network Dimensioning. NetSys Johannes Inführ, David Stezenbach, Matthias Hartmann, Kurt Tutschku, Günther R. Raidl
2012	B	`conf`	A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem. EvoCOP Martin Schwengerer, Sandro Pirkwieser, Günther R. Raidl
2012	A	`conf`	An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. GECCO Bin Hu, Günther R. Raidl
2012	B	`conf`	Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles. EvoApplications Thorsten Krenek, Mario Ruthmair, Günther R. Raidl, Michael Planer
2012	B	`conf`	Hybrid Heuristics for Multimodal Homecare Scheduling. CPAIOR Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger, Günther R. Raidl
2012	C	`conf`	On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem. ISCO Mario Ruthmair, Günther R. Raidl
2012	J	`jnl`	Solving the post enrolment course timetabling problem by ant colony optimization. Ann. Oper. Res. Clemens Nothegger, Alfred Mayer, Andreas M. Chwatal, Günther R. Raidl
2012	—	`conf`	Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design. PPSN (1) Christian Schauer, Günther R. Raidl
2011	C	`conf`	A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application. FedCSIS Andreas M. Chwatal, Corinna Thöni, Karin Oberlechner, Günther R. Raidl
2011	B	`conf`	A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. IPCO Mario Ruthmair, Günther R. Raidl
2011	—	`conf`	A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST (1) Mario Ruthmair, Günther R. Raidl
2011	—	`conf`	A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST (1) Martin Berlakovich, Mario Ruthmair, Günther R. Raidl
2011	—	`conf`	An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem. EUROCAST (1) Bin Hu, Günther R. Raidl
2011	—	`conf`	Automatic Generation of 2-AntWars Players with Genetic Programming. EUROCAST (1) Johannes Inführ, Günther R. Raidl
2011	J	`jnl`	Branch-and-Cut-and-Price for Capacitated Connected Facility Location. J. Math. Model. Algorithms Markus Leitner, Günther R. Raidl
2011	J	`jnl`	Hybrid metaheuristics in combinatorial optimization: A survey. Appl. Soft Comput. Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli
2011	—	`conf`	Improved Packing and Routing of Vehicles with Compartments. EUROCAST (1) Sandro Pirkwieser, Günther R. Raidl, Jens Gottlieb
2011	C	`conf`	Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints. INOC Johannes Inführ, Günther R. Raidl
2011	J	`jnl`	Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques. Adv. Oper. Res. Andreas M. Chwatal, Günther R. Raidl
2011	C	`conf`	Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem. INOC Markus Leitner, Mario Ruthmair, Günther R. Raidl
2011	—	`conf`	Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location. EUROCAST (1) Markus Leitner, Günther R. Raidl
2010	—	`ch.`	(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. Matheuristics Martin Gruber, Günther R. Raidl
2010	—	`conf`	A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents. Hybrid Metaheuristics Christian Schauer, Matthias Prandtstetter, Günther R. Raidl
2010	—	`conf`	A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem. INCoS Anna Pagacz, Bin Hu, Günther R. Raidl
2010	B	`conf`	Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive. EvoCOP Günther R. Raidl, Bin Hu
2010	A	`conf`	Fitting multi-planet transit models to photometric time-data series by evolution strategies. GECCO Andreas M. Chwatal, Günther R. Raidl, Michael Zöch
2010	—	`ed.`	Hybrid Metaheuristics - 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010. Proceedings Hybrid Metaheuristics Maria J. Blesa, Christian Blum, Günther R. Raidl, Andrea Roli, Michael Sampels
2010	—	`ch.`	MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics. Matheuristics Jakob Puchinger, Günther R. Raidl, Sandro Pirkwieser
2010	B	`conf`	Multilevel Variable Neighborhood Search for Periodic Routing Problems. EvoCOP Sandro Pirkwieser, Günther R. Raidl
2010	B	`conf`	Similarity Searching in Sequences of Complex Events. RCIS Hannes Obweger, Martin Suntinger, Josef Schiefer, Günther R. Raidl
2010	—	`conf`	Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization. GEM Andreas M. Chwatal, Günther R. Raidl
2010	J	`jnl`	Strong Lower Bounds for a Survivable Network Design Problem. Electron. Notes Discret. Math. Markus Leitner, Günther R. Raidl
2010	J	`jnl`	The Multidimensional Knapsack Problem: Structure and Algorithms. INFORMS J. Comput. Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
2010	J	`jnl`	The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search. Networks Bin Hu, Markus Leitner, Günther R. Raidl
2010	—	`conf`	Trend-Based Similarity Search in Time-Series Data. DBKDA Martin Suntinger, Hannes Obweger, Josef Schiefer, Philip Limbeck, Günther R. Raidl
2010	—	`conf`	Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem. Hybrid Metaheuristics Sandro Pirkwieser, Günther R. Raidl
2010	—	`conf`	Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. PPSN (2) Mario Ruthmair, Günther R. Raidl
2009	B	`conf`	A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse. EvoCOP Matthias Prandtstetter, Günther R. Raidl, Thomas Misar
2009	—	`conf`	A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST Mario Ruthmair, Günther R. Raidl
2009	—	`conf`	A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem. HIS (3) Bin Hu, Günther R. Raidl
2009	A	`conf`	Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances. GECCO Martin Gruber, Günther R. Raidl
2009	—	`conf`	Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms. EUROCAST Andreas M. Chwatal, Günther R. Raidl
2009	A	`conf`	Meta-heuristics for reconstructing cross cut shredded text documents. GECCO Matthias Prandtstetter, Günther R. Raidl
2009	—	`conf`	Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows. Hybrid Metaheuristics Sandro Pirkwieser, Günther R. Raidl
2009	J	`jnl`	Solving a J. Math. Model. Algorithms Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner
2009	—	`conf`	Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search. Hybrid Metaheuristics Jakob Walla, Mario Ruthmair, Günther R. Raidl
2009	—	`conf`	Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics. EUROCAST Martin Gruber, Günther R. Raidl
2008	—	`ch.`	A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger
2008	J	`jnl`	An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. Eur. J. Oper. Res. Matthias Prandtstetter, Günther R. Raidl
2008	J	`jnl`	Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J. Heuristics Jakob Puchinger, Günther R. Raidl
2008	—	`ch.`	Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization. Hybrid Metaheuristics Günther R. Raidl, Jakob Puchinger
2008	—	`conf`	Combining Forces to Reconstruct Strip Shredded Text Documents. Hybrid Metaheuristics Matthias Prandtstetter, Günther R. Raidl
2008	J	`jnl`	Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J. Heuristics Bin Hu, Markus Leitner, Günther R. Raidl
2008	B	`conf`	Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. EvoCOP Bin Hu, Günther R. Raidl
2008	A	`conf`	Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. GECCO Sandro Pirkwieser, Günther R. Raidl
2008	—	`conf`	Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. SAINT Martin Gruber, Günther R. Raidl
2008	—	`conf`	Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. Hybrid Metaheuristics Markus Leitner, Günther R. Raidl
2008	C	`conf`	Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem. HIS Bin Hu, Günther R. Raidl
2008	—	`conf`	Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem. SAINT Markus Leitner, Günther R. Raidl
2007	B	`conf`	Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. EvoCOP Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger
2007	—	`conf`	Determining Orbital Elements of Extrasolar Planets by Evolution Strategies. EUROCAST Andreas M. Chwatal, Günther R. Raidl
2007	J	`jnl`	Models and algorithms for three-stage two-dimensional bin packing. Eur. J. Oper. Res. Jakob Puchinger, Günther R. Raidl
2006	—	`conf`	A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. OR Daniel Wagner, Günther R. Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl
2006	—	`conf`	A Unified View on Hybrid Metaheuristics. Hybrid Metaheuristics Günther R. Raidl
2006	J	`jnl`	Biased Mutation Operators for Subgraph-Selection Problems. IEEE Trans. Evol. Comput. Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom
2006	B	`ed.`	Evolutionary Computation in Combinatorial Optimization, 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings EvoCOP Jens Gottlieb, Günther R. Raidl
2006	A	`conf`	Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. GECCO Martin Gruber, Jano I. van Hemert, Günther R. Raidl
2006	B	`conf`	The Core Concept for the Multidimensional Knapsack Problem. EvoCOP Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
2005	—	`conf`	Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. IWINAC (2) Jakob Puchinger, Günther R. Raidl
2005	J	`jnl`	Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem. Evol. Comput. Günther R. Raidl, Jens Gottlieb
2005	B	`ed.`	Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings EvoCOP Günther R. Raidl, Jens Gottlieb
2004	A	`conf`	An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. PPSN Jakob Puchinger, Günther R. Raidl
2004	A	`conf`	An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem. PPSN Gabriele Koller, Günther R. Raidl
2004	Misc	`conf`	An improved hybrid genetic algorithm for the generalized assignment problem. SAC Harald Feltl, Günther R. Raidl
2004	—	`ed.`	Applications of Evolutionary Computing, EvoWorkshops 2004: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC, Coimbra, Portugal, April 5-7, 2004, Proceedings EvoWorkshops 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
2004	—	`conf`	Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher
2004	J	`jnl`	Editorial. J. Math. Model. Algorithms Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl, Colin Reeves
2004	B	`ed.`	Evolutionary Computation in Combinatorial Optimization, 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, Proceedings EvoCOP Jens Gottlieb, Günther R. Raidl
2004	B	`conf`	Solving a Real-World Glass Cutting Problem. EvoCOP Jakob Puchinger, Günther R. Raidl, Gabriele Koller
2003	J	`jnl`	A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. J. Heuristics Ivana Ljubic, Günther R. Raidl
2003	—	`ed.`	Applications of Evolutionary Computing, EvoWorkshop 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April 14-16, 2003, Proceedings EvoWorkshops 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
2003	J	`jnl`	Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evol. Comput. Günther R. Raidl, Bryant A. Julstrom
2003	Misc	`conf`	Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. SAC Günther R. Raidl, Bryant A. Julstrom
2002	—	`conf`	A Memetic Algorithm for Vertex-Biconnectivity Augmentation. EvoWorkshops Sandor Kersting, Günther R. Raidl, Ivana Ljubic
2002	—	`ed.`	Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings EvoWorkshops Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl
2002	Misc	`conf`	Evolutionary computation and optimization track: SAC 2002. SAC Roger L. Wainwright, Günther R. Raidl
2002	J	`jnl`	Evolutionary local search for the edge-biconnectivity augmentation problem. Inf. Process. Lett. Günther R. Raidl, Ivana Ljubic
2002	Misc	`conf`	Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. SAC Bryant A. Julstrom, Günther R. Raidl
2002	B	`conf`	Letting ants labeling point features [sic.: for 'labeling' read 'label']. IEEE Congress on Evolutionary Computation Michael Schreyer, Günther R. Raidl
2002	A	`conf`	On Weight-Biased Mutation for Graph Problems. PPSN Günther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom
2001	—	`conf`	An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem. EvoWorkshops Ivana Ljubic, Günther R. Raidl
2001	—	`ed.`	Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings EvoWorkshops Egbert J. W. Boers, Jens Gottlieb, Pier Luca Lanzi, Robert E. Smith, Stefano Cagnoni, Emma Hart, Günther R. Raidl, H. Tijink
2001	Misc	`conf`	Evolutionary computation and optimization track. SAC Roger L. Wainwright, Günther R. Raidl
2001	Misc	`conf`	Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. SAC Bryant A. Julstrom, Günther R. Raidl
2000	A	`conf`	A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. PPSN Ivana Ljubic, Günther R. Raidl, Jozef Kratica
2000	—	`conf`	A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. SAC (1) Günther R. Raidl, Bryant A. Julstrom
2000	B	`conf`	An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. CEC Günther R. Raidl
2000	A	`conf`	The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search. GECCO Jens Gottlieb, Günther R. Raidl
1999	Misc	`conf`	A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem. SAC Günther R. Raidl
1999	—	`conf`	Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem. Artificial Evolution Jens Gottlieb, Günther R. Raidl
1999	B	`conf`	Weight-codings in a genetic algorithm for the multi-constraint knapsack problem. CEC Günther R. Raidl
1998	—	`conf`	Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks. NC Günther R. Raidl, Gabriele Kodydek
1998	A	`conf`	Genetic Algorithms for the Multiple Container Packing Problem. PPSN Günther R. Raidl, Gabriele Kodydek
1998	—	`conf`	Transforming an analytically defined color space to match psychophysically gained color distances. Color Imaging: Device-Independent Color, Color Hardcopy, and Graphic Arts Ingeborg Tastl, Günther R. Raidl
1997	C	`conf`	Finding a perceptual uniform color space with evolution strategies. ICEC Günther R. Raidl, Ingeborg Tastl
1996	—	`conf`	Skillful Genotype Decoding in EAs for Solving the Cutting Problem. Evolutionary Programming Günther R. Raidl