Publications: Günther Raidl

⬅️ Zurück zum Profil

2026

• Complexity of Positive Influence Domination on Partial Grids Iurlano, Enrico, Raidl, Günther R.. Fundamentals of Computation Theory—25th International Symposium
  📄 Details

• The Graph Burning Problem under Constrained Diffusion Iurlano, Enrico, Raidl, Günther R., Djukanović, Marko. Advances in Optimization and Wildfire
  📄 Details

• Superstrings of Uniform-Cardinality Set Systems via the Generalized Traveling Salesperson Problem Weissenfels, Alexander, Iurlano, Enrico, Raidl, Günther R..
  📄 Details

• A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs Wustinger, Martin, Iurlano, Enrico, Raidl, Günther R..
  📄 Details

2025

• Improvements in Large Neighborhood Search for the Electric Autonomous Dial-A-Ride Problem Bresich, Maria, Raidl, Günther R., Limmer, Steffen. Computer Aided Systems Theory – EUROCAST 2024
  📄 Details

• ACM Transactions on Evolutionary Learning and Optimization M. Bresich, ünther R. Raidl, Steffen Limmer.
  📄 Details

• Putting Tutte’s Counterexample to Tait’s Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphs Fleischner, Herbert, Iurlano, Enrico, Raidl, Günther R..
  📄 Details

• Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime Bresich, Maria, Raidl, Günther R., Limmer, Steffen. Computer Aided Systems Theory – EUROCAST 2024
  📄 Details

• Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem Huang, William, Mei, Yi, Raidl, Günther, Zhang, Fangfang, Tomandl, Laurenz, Limmer, Steffen, Zhang, Mengjie, Rodemann, Tobias. 2025 IEEE Congress on Evolutionary Computation (CEC)
  📄 Details

• Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding Huber, Marc, Raidl, Günther R., Blum, Christian. Computer Aided Systems Theory – EUROCAST 2024
  📄 Details

• Tackling the Alpha-Domination Problem Heuristically Iurlano, Enrico, Varga, Johannes, Raidl, Günther R.. Computer Aided Systems Theory – EUROCAST 2024
  📄 Details

• SAT-Based Search for Minwise Independent Families Iurlano, Enrico, Raidl, Günther R..
  📄 Details

• A Learning Twolevel Optimization Approach for the Demand Maximizing Battery Swapping Station Location Problem Tomandl, Laurenz, Jatschka, Thomas, Raidl, Günther, Rodemann, Tobias. Computer Aided Systems Theory – EUROCAST 2024
  📄 Details

2024

• Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem Bresich, Maria, Varga, Johannes, Raidl, Günther R., Limmer, Steffen. Metaheuristics and Nature Inspired Computing
  📄 Details

• Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion Bresich, Maria, Raidl, Günther R., Limmer, Steffen. Proceedings of the Genetic and Evolutionary Computation Conference
  📄 Details

• A Simulated Annealing Based Approach for the Roman Domination Problem Greilhuber, Jakob, Schober, Sophia, Iurlano, Enrico, Raidl, Günther R.. Metaheuristics and Nature Inspired Computing
  📄 Details

• Signed double Roman domination on cubic graphs Iurlano, Enrico, Zec, Tatjana, Djukanović, Marko, Raidl, Günther R.. Applied Mathematics and Computation
  📄 Details

• A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem Reixach, Jaume, Blum, Christian, Djukanović, Marko, Raidl, Günther R.. IEEE Transactions on Evolutionary Computation
  📄 Details

• A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem Reixach, Jaume, Blum, Christian, Djukanović, Marko, Raidl, Günther R.. Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2024
  📄 Details

• Exact methods for the Selective Assessment Routing Problem Salvà Soler, Joan, Hemmelmayr, Vera C., Raidl, Günther R.. Central European Journal of Operations Research
  📄 Details

• Selecting User Queries in Interactive Job Scheduling Varga, Johannes, Raidl, Günther R., Todemann, Tobias. 19th International Conference on Computer Aided Systems Theory
  📄 Details

• Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks Varga, Johannes, Karlsson, Emil, Raidl, Günther R., R\n̈nberg, Elina, Lindsten, Fredrik, Rodemann, Tobias. Machine Learning, Optimization, and Data Science. LOD 2023.
  📄 Details

• Scheduling Jobs Using Queries to Interactively Learn Human Availability Times Varga, Johannes, Raidl, Günther R., Rönnberg, Elina, Rodemann, Tobias. Computers & Operations Research
  📄 Details

2023

• A Policy-Based Learning Beam Search for Combinatorial Optimization Ettrich, Rupert, Huber, Marc, Raidl, Günther R.. Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023
  📄 Details

• Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines Nikolaus Frohner, Günther R. Raidl, Francisco Chicano.
  📄 Details

• A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem Huber, Marc, Raidl, Günther R.. Computer Aided Systems Theory – EUROCAST 2022
  📄 Details

• A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning Jatschka, Thomas, Rodemann, Tobias, Raidl, Günther R.. Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023
  📄 Details

• Optimizing the positions of battery swapping stations – Pilot Studies and Layout Optimization Algorithm Rodemann, Tobias, Kataoka, Hiroaki, Jatschka, Thomas, Raidl, Günther R., Limmer, Steffen, Meguro Hiromu. Proceedings to the 6th International Electric Vehicle Technology Conference
  📄 Details

• An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles Limmer, Steffen, Varga, Johannes, Raidl, Günther R.. EvoApplications 2023: Applications of Evolutionary Computation
  📄 Details

• Large Neighborhood Search for Electric Vehicle Fleet Scheduling Limmer, Steffen, Varga, Johannes, Raidl, Günther R.. Energies
  📄 Details

• Interactive Job Scheduling with Partially Known Personnel Availabilities Varga, Johannes, Raidl, Günther R. , Rönnberg, Elina, Rodemann, Tobias. OLA 2023: Optimization and Learning
  📄 Details

2022

• Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences Djukanovic, Marko, Kartelj, Aleksandar, Matić, Dragan, Grbić, Milana, Blum, Christian, Raidl, Günther R.. Applied Soft Computing
  📄 Details

• Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime N. Frohner, G. R. Raidl. Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022
  📄 Details

• Parallel Beam Search for Combinatorial Optimization Frohner, Nikolaus, Gmys, Jan, Melab, Nourdine,, Raidl, Günther, Talbi, El-ghazali. Fifteenth International Symposium on Combinatorial Search (SoCS 2022)
  📄 Details

• Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems Huber, Marc, Raidl, Günther R.. Machine Learning, Optimization, and Data Science, LOD 2021
  📄 Details

• A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems Huber, Marc, Raidl, Günther R.. Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022
  📄 Details

• A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications Jatschka, Thomas, Rodemann, Tobias, Raidl, Günther R.. Metaheuristics and Nature Inspired Computing
  📄 Details

• A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters Jatschka, Thomas, Rauscher, Matthias, Kreutzer, Bernhard, Okamoto, Yusuke, Rodemann, Tobias, Raidl, Günther R.. Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022)
  📄 Details

• A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation Mayerhofer, Jonas, Kirchweger, Markus, Huber, Marc, Raidl, Günther. Evolutionary Computation in Combinatorial Optimization - 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, Proceedings
  📄 Details

• A Learning Large Neighborhood Search for the Staff Rerostering Problem Oberweger, Fabio F., Raidl, Günther R., Rönnberg, Elina, Huber, Marc. Integration of Constraint Programming, Artificial Intelligence, and Operations Research – CPAIOR 2022
  📄 Details

• Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet Johannes Varga, Günther R. Raidl, Steffen Limmer. Access
  📄 Details

2021

• Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems Adrian Bracher, Nikolaus Frohner, Günther R. Raidl. 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21)
  📄 Details

• Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings Djukanovic, Marko, Kartelj Aleksandar, Matic, Dragan,, Grbic, Milana, Blum, Christian, Raidl, Guenther.
  📄 Details

• Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines Nikolaus Frohner, Matthias Horn, Günther R. Raidl. Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020)
  📄 Details

• A Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources* Matthias Horn, Günther R. Raidl, Elina R\n̈nberg. Annals of Operations Research
  📄 Details

• A-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem* Matthias Horn, Johannes Maschler, Günther R. Raidl, Elina Rönnberg. Computers & Operations Research
  📄 Details

• Driver Shift Planning for an Online Store with Short Delivery Times Matthias Horn, Nikolaus Frohner, Günther R. Raidl. Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020)
  📄 Details

• A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Thomas Jatschka, Günther R. Raidl, Tobias Rodemann. Algorithms
  📄 Details

• Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers Schaden, Benjamin, Jatschka, Thomas, Limmer, Steffen, Raidl, Günther R.. Energies
  📄 Details

• Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Johannes Maschler, Günther R. Raidl. Annals of Operations Research
  📄 Details

• Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings Nikolic, Bojan, Kartelj Aleksandar, Djukanovic, Marko, Grbic, Milana, Blum, Christian, Raidl, Guenther. Mathematics
  📄 Details

2020

• Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günther R. Raidl. Computers & Operations Research
  📄 Details

• A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation Djukanovic, Marko, Raidl, Günther R, Blum, Christian. Proceedings of LOD 2019 – The 5th International Conference on Machine Learning, Optimization and Data Science
  📄 Details

• Anytime Algorithms for the Longest Common Palindromic Subsequence Problem Marko Djukanovic, Günther R. Raidl, Christian Blum. Computers & Operations Research
  📄 Details

• An A Search Algorithm for the Constrained Longest Common Subsequence Problem* Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum. Information Processing Letters
  📄 Details

• On Solving a Generalized Constrained Longest Common Subsequence Problem Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum. Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications
  📄 Details

• Finding Longest Common Subsequences: New anytime A$^*$ Search Results Marko Djukanovic, Günther R. Raidl, Christian Blum. Applied Soft Computing
  📄 Details

• Casual Employee Scheduling with Constraint Programming and Metaheuristics Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl. Computer Aided Systems Theory – EUROCAST 2019
  📄 Details

• Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers Nikolaus Frohner, Günther R. Raidl. Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019
  📄 Details

• A Beam Search Approach to the Traveling Tournament Problem Nikolaus Frohner, Bernhard Neumann, Günther R. Raidl. Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020
  📄 Details

• A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility Nikolaus Frohner, Günther R. Raidl. Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2020: Volume I
  📄 Details

• Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem Matthias Horn, Günther R. Raidl. Computer Aided Systems Theory – EUROCAST 2019
  📄 Details

• On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences Horn, Matthias, Djukanovic, Marko, Blum, Christian, Raidl , Günther R.. Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications
  📄 Details

• A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources Jatschka, Thomas, Rodemann, Tobias, Raidl, Günther R..
  📄 Details

• VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points Jatschka, Thomas, Rodemann, Tobias, Raidl, Günther R.. Computer Aided Systems Theory – EUROCAST 2019
  📄 Details

• Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Jatschka, Thomas, Rodemann, Tobias, Raidl, Günther R.. Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019
  📄 Details

• Distributing Battery Swapping Stations for Electric Scooters in an Urban Area Jatschka, Thomas, Oberweger, Fabio F., Rodemann, Tobias, Raidl, Günther R.. Optimization and Applications, Proceedings of OPTIMA~2020 – XI International Conference Optimization and Applications
  📄 Details

• A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem Kaufmann, Thomas, Horn, Matthias, Raidl, Günther R.. Proceedings of PPSN XVI: Parallel Problem Solving from Nature
  📄 Details

• A Model for Finding Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther R. Raidl. Discrete Applied Mathematics
  📄 Details

• A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three Benedikt Klocker, Herbert Fleischner, Günther R. Raidl. Applied Mathematics and Computation
  📄 Details

• An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem Riedler, Martin, Jatschka, Thomas, Maschler, Johannes, Raidl, Günther R.. International Transactions in Operational Research
  📄 Details

2019

• A Memetic Algorithm for Competitive Facility Location Problems Benjamin Biesinger, Bin Hu, Günther R. Raidl. Business and Consumer Analytics: New Ideas
  📄 Details

• Finding Longest Common Subsequences: New A Anytime Results* Marko Djukanovic, Günther R. Raidl, Christian Blum.
  📄 Details

• Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem Marko Djukanovic, Günther R. Raidl, Christian Blum. Proceedings of LION~12 – the 12th International Conference on Learning and Intelligent Optimization
  📄 Details

• A Heuristic Approach for Solving the Longest Common Square Subsequence Problem Djukanovic, Marko, Raidl, Günther R., Blum, Christian. Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory (EUROCAST 2019)
  📄 Details

• Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl. Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019)
  📄 Details

• Towards Improving Merging Heuristics for Binary Decision Diagrams Nikolaus Frohner, Günther R. Raidl. Learning and Intelligent Optimization – 13th International Conference, LION 13
  📄 Details

• Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem Matthias Horn, Günther R. Raidl. Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019)
  📄 Details

• Job Sequencing with One Common and Multiple Secondary Resources: An A/Beam Search Based Anytime Algorithm* Matthias Horn, Günther Raidl, Christian Blum. Artificial Intelligence
  📄 Details

• A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem Blum, Christian, Thiruvady, Dhananjay, Ernst, Andreas T., Horn, Matthias, Raidl, Günther R.. Proceedings of AI 2019: Advances in Artificial Intelligence
  📄 Details

• A Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources* Matthias Horn, Günther Raidl, Elina Rönnberg.
  📄 Details

• A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Jatschka, Thomas, Rodemann, Tobias, Raidl, Günther R.. Evolutionary Computation in Combinatorial Optimization
  📄 Details

• VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points Jatschka, Thomas, Rodemann, Tobias, Raidl, Günther R.. Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019)
  📄 Details

• A SAT Approach for Finding Sup-Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther R. Raidl. Learning and Intelligent Optimization. LION~2019
  📄 Details

• A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three Benedikt Klocker, Herbert Fleischner, Günther R. Raidl.
  📄 Details

• A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems Christian Kloimüllner, Günther R. Raidl. Learning and Intelligent Optimization – 13th International Conference, LION 13
  📄 Details

• Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Johannes Maschler, Günther Raidl.
  📄 Details

• Metaheuristic Hybrids Günther R. Raidl, Jakob Puchinger, Christian Blum. Handbook of Metaheuristics
  📄 Details

• Strategies for Iteratively Refining Layered Graph Models Martin Riedler, Mario Ruthmair, Günther R. Raidl. Hybrid Metaheuristics: 11th International Workshop, HM 2019
  📄 Details

2018

• A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands Benjamin Biesinger, Bin Hu, Günther R. Raidl. Transportation Science
  📄 Details

• Anytime Algorithms for the Longest Common Palindromic Subsequence Problem Marko Djukanovic, Günther Raidl, Christian Blum.
  📄 Details

• 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. Computer Aided Systems Theory – EUROCAST 2017, Part I
  📄 Details

• An A Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows* Matthias Horn, Günther R. Raidl, Elina Rönnberg. PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling
  📄 Details

• A-Based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem* Matthias Horn, Johannes Maschler, Günther Raidl, Elina Rönnberg.
  📄 Details

• Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Klocker, Benedikt, Raidl, Günther R. Computer Aided Systems Theory – EUROCAST 2017, Part I
  📄 Details

• Finding Smooth Graphs with Small Independence Numbers Klocker, Benedikt, Fleischner, Herbert, Raidl, Günther R.. MOD~2017: Machine Learning, Optimization, and Big Data – Third International Conference
  📄 Details

• A Model for Finding Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther Raidl.
  📄 Details

• A SAT Approach for Finding Sup-Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther Raidl.
  📄 Details

• Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem Johannes Maschler, Günther R. Raidl. PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling
  📄 Details

• Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments Johannes Maschler, Günther Raidl.
  📄 Details

• Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition Martin Riedler, Günther Raidl. Computers & Operations Research
  📄 Details

• Semi-Automated Location Planning for Urban Bike-Sharing Systems Markus Straub, Christian Rudloff, Anita Graser, Christian Kloimüllner, Günther R. Raidl, Markus Pajones, Felix Beyer. Proceedings of the 7th Transport Research Arena (TRA~2018)
  📄 Details

2017

• A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem Frederico Dusberger, Günther R. Raidl. Operations Research Proceedings 2015 — Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1–4, 2015
  📄 Details

• GRASP and 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. Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory – EUROCAST 2017
  📄 Details

• Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment Matthias Horn, Raidl, Günther R., Christian Blum. MOD~2017: Machine Learning, Optimization, and Big Data – Third International Conference
  📄 Details

• Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control Kim, Bong-Min, Kloimüllner, Christian, Raidl, Günther R.. Evolutionary Computation in Combinatorial Optimization. EvoCOP~2017
  📄 Details

• Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Klocker, Benedikt, Raidl, Günther R. Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017)
  📄 Details

• Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition Kloimüllner, Christian, Raidl, G\n̈ther R.. Networks
  📄 Details

• Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem Christian Kloimüllner, G\n̈ther R. Raidl. Conference Proceedings of Learning and Intelligent Optimization Conference (LION~11)
  📄 Details

• Large Neighborhood Search for the Most Strings with Few Bad Columns Problem Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl. Soft Computing
  📄 Details

• Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments Maschler, Johannes, Riedler, Martin, Raidl, Günther R.. Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017)
  📄 Details

• A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem Johannes Maschler, Günther R. Raidl. Operations Research Proceedings 2015 — Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1–4, 2015
  📄 Details

• Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm Petrica C. Pop, Cosmin Sabo, Benjamin Biesinger, Bin Hu, Günther R. Raidl. Carpathian Journal of Mathematics
  📄 Details

• An Iterative Time-Bucket Refinement Algorithm for a High Resolution Resource-Constrained Project Scheduling Problem Martin Riedler, Thomas Jatschka, Johannes Maschler, Günther Raidl.
  📄 Details

2016

• Models and Algorithms for Competitive Facility Location Problems with Different Customer Behavior Benjamin Biesinger, Bin Hu, Günther Raidl. Annals of Mathematics and Artificial Intelligence
  📄 Details

• An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands Benjamin Biesinger, Bin Hu, Günther R. Raidl. Electronic Notes in Discrete Mathematics
  📄 Details

• A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands Benjamin Biesinger, Bin Hu, Günther Raidl.
  📄 Details

• Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem Christian Blum, Günther R. Raidl. Optimization Letters
  📄 Details

• Hybrid Metaheuristics – Powerful Tools for Optimization Christian Blum, Günther R. Raidl.
  📄 Details

• A Memetic Algorithm for the Virtual Network Mapping Problem Johannes Inführ, Günther Raidl. Journal of Heuristics
  📄 Details

• Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers Benedikt Klocker, Herbert Fleischner, Günther R. Raidl. Hybrid Metaheuristics: 10th International Workshop, HM 2016
  📄 Details

• Particle Therapy Patient Scheduling: First Heuristic Approaches Johannes Maschler, Martin Riedler, Markus Stock, Günther R. Raidl. PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling
  📄 Details

• Districting and Routing for Security Control Michael Prischink, Christian Kloimüllner, Benjamin Biesinger, Günther R. Raidl. Hybrid Metaheuristics: 10th International Workshop, HM 2016
  📄 Details

• Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics Günther R. Raidl, Thomas Jatschka, Martin Riedler, Johannes Maschler. Proceedings of Matheuristics 2016: 6th International Workshop on Model-Based Metaheuristics
  📄 Details

• 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. Journal of Heuristics
  📄 Details

• Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition Martin Riedler, Günther Raidl.
  📄 Details

• A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design Christian Schauer, Günther R. Raidl. Electronic Notes in Discrete Mathematics
  📄 Details

2015

• A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles Christopher Bacher, Günther R. Raidl, Thorsten Krenek. Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015)
  📄 Details

• Numerische Optimierung elektrifizierter Antriebsstränge Krenek, Thorsten, Bacher, Christopher, Lauer, Thomas, Raidl, Günther R.. Motortechnische Zeitschrift (MTZ)
  📄 Details

• Numerical Optimisation of Electro-Hybrid Powertrains Krenek, Thorsten, Bacher, Christopher, Lauer, Thomas, Raidl, Günther R.. MTZ Worldwide
  📄 Details

• A Hybrid Genetic Algorithm with Solution Archive for the Discrete (r|p)-Centroid Problem Benjamin Biesinger, Bin Hu, Günther Raidl. Journal of Heuristics
  📄 Details

• A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands Benjamin Biesinger, Bin Hu, Günther R. Raidl. Evolutionary Computation in Combinatorial Optimization – EvoCOP~2015
  📄 Details

• A Genetic Algorithm for the Capacity and Distance Constrained Plant Location Problem Matthias Lanzinger, Benjamin Biesinger, Bin Hu, Günther R. Raidl. Proceedings of the 11th Metaheuristics International Conference
  📄 Details

• Heuristic Approaches for the Probabilistic Traveling Salesman Problem Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl. Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015)
  📄 Details

• Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search Frederico Dusberger, Günther R. Raidl. The 3rd International Conference on Variable Neighborhood Search (VNS'14)
  📄 Details

• A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size Frederico Dusberger, Günther R. Raidl. Computer Aided Systems Theory – EUROCAST 2015
  📄 Details

• A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size Frederico Dusberger, Günther R. Raidl. Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015)
  📄 Details

• Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem Gerhard Hiermann, Matthias Prandtstetter, Andrea Rendl, Jakob Puchinger, Günther R. Raidl. Central European Journal of Operations Research
  📄 Details

• A New Solution Representation for the Firefighter Problem Bin Hu, Andreas Windbichler, Günther R. Raidl. Evolutionary Computation in Combinatorial Optimization – EvoCOP~2015
  📄 Details

• A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems Christian Kloimüllner, Petrina Papazek, Günther R. Raidl. Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015)
  📄 Details

• On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl. Proceedings of the 2015 International Symposium on Innovations in Intelligent Systems and Applications (INISTA)
  📄 Details

• CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem David Markvica, Christian Schauer, Günther R. Raidl. Computer Aided Systems Theory – EUROCAST 2015
  📄 Details

• Decomposition Based Hybrid Metaheuristics Günther R. Raidl. European Journal of Operational Research
  📄 Details

• PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems Rainer-Harbach, Marian, Papazek, Petrina, Raidl, Günther R., Hu, Bin, Kloimüllner, Christian. Journal of Global Optimization
  📄 Details

• 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. Computer Aided Systems Theory – EUROCAST 2015
  📄 Details

• Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem Alan Tus, Andrea Rendl, Günther R. Raidl. Conference Proceedings of Learning and Intelligent Optimization Conference (LION~9)
  📄 Details

2014

• Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles Bacher, Christopher, Krenek, Thorsten, Raidl, Günther R.. Applications of Evolutionary Computation
  📄 Details

• An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior Benjamin Biesinger, Bin Hu, Günther R. Raidl. Conference Proceedings of Learning and Intelligent Optimization Conference (LION~8)
  📄 Details

• 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, 9th Int. Workshop, HM 2014
  📄 Details

• A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure Grujicic, Igor, Raidl, Günther R., Schöbel, Andreas, Besau, Gerhard. Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA~2014
  📄 Details

• Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructure Grujicic, Igor, Raidl, Günther R., Schöbel, Andreas. Proceedings of the 3rd International Conference on Variable Neighborhood Search
  📄 Details

• Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther~R.Raidl. *Evolutionary Computation in Combinatorial Optimization – EvoCOP2014*
  📄 Details

• Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid Papazek, Petrina, Kloimüllner, Christian, Hu, Bin, Raidl, Günther R.. Parallel Problem Solving from Nature – PPSN XIII
  📄 Details

• 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. Hybrid Metaheuristics, 9th Int. Workshop, HM 2014
  📄 Details

• Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search Günther R. Raidl, T. Baumhauer, B. Hu. Proceedings of the 3rd International Conference on Variable Neighborhood Search
  📄 Details

2013

• Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive Benjamin Biesinger, Christian Schauer, Bin Hu, Günther R. Raidl. Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory
  📄 Details

• Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents Benjamin Biesinger, Christian Schauer, Bin Hu, Günther R. Raidl. Computer Aided Systems Theory – EUROCAST 2013
  📄 Details

• A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem Bin Hu, Werner Ölz, G\n̈ther R. Raidl. Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory
  📄 Details

• Using Optimized Virtual Network Embedding for Network Dimensioning Johannes Inführ, David Stezenbach, Matthias Hartmann, Kurt Tutschku, Günther R. Raidl. Proceedings of Networked Systems 2013
  📄 Details

• Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent Johannes Inführ, Günther R. Raidl. Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP~2013
  📄 Details

• GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem Johannes Inführ, G\n̈ther R. Raidl. Hybrid Metaheuristics, 8th Int. Workshop, HM 2013
  📄 Details

• A Memetic Algorithm for the Virtual Network Mapping Problem Johannes Inführ, G\n̈ther R. Raidl. Proceedings of the 10th Metaheuristics International Conference
  📄 Details

• Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problem Peter Jahrmann, Günther R. Raidl. Proceedings of the 10th Metaheuristics International Conference
  📄 Details

• Stabilizing Branch-and-Price for Constrained Tree Problems Markus Leitner, Mario Ruthmair, Günther R. Raidl. Networks
  📄 Details

• A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems Petrina Papazek, Günther~R.~Raidl, Marian Rainer-Harbach, Bin Hu. Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory
  📄 Details

• A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems Papazek, Petrina, Raidl, Günther R., Rainer-Harbach, Marian, Hu, Bin. Computer Aided Systems Theory – EUROCAST 2013
  📄 Details

• A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables Michael Pimmer, Günther R. Raidl. Advances in Metaheuristics
  📄 Details

• A Memetic Algorithm for the Partition Graph Coloring Problem Petrica C. Pop, Bin Hu, Günther R. Raidl. Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory
  📄 Details

• A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem Petrica C. Pop, Bin Hu, Günther R. Raidl. Computer Aided Systems Theory – EUROCAST 2013
  📄 Details

• Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations Günther R. Raidl, Bin Hu, Marian Rainer-Harbach, Petrina Papazek. Hybrid Metaheuristics, 8th Int. Workshop, HM 2013
  📄 Details

• Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl. Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP~2013
  📄 Details

• PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl.
  📄 Details

• An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure Andreas Schöbel, G\n̈ther R. Raidl, Igor Grujicic, Gerhard Besau, Gottfried Schuster. Proceedings of the 5th International Seminar on Railway Operations Modelling and Analysis – RailCopenhagen~2013
  📄 Details

2012

• A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Martin Berlakovich, Mario Ruthmair, Günther R. Raidl. Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I
  📄 Details

• An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem Bin Hu, Günther R. Raidl. Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO)
  📄 Details

• An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem Bin Hu, Günther R. Raidl. Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I
  📄 Details

• Automatic Generation of 2-AntWars Players with Genetic Programming Johannes Inführ, G\n̈ther R. Raidl. Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I
  📄 Details

• Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles Thorsten Krenek, Mario Ruthmair, Günther R. Raidl, Michael Planer. Applications of Evolutionary Computation – EvoApplications~2012
  📄 Details

• Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl. Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I
  📄 Details

• Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Clemens Nothegger, Alfred Mayer, Andreas Chwatal, Günther R. Raidl. Annals of Operations Research
  📄 Details

• Improved Packing and Routing of Vehicles with Compartments Sandro Pirkwieser, Günther~R. Raidl, Jens Gottlieb. Computer Aided Systems Theory – EUROCAST 2011: 13th International Conference, Las Palmas de Gran Canaria, Spain, February 6–11, 2011, Revised Selected Papers, Part I
  📄 Details

• Hybrid Heuristics for Multimodal Homecare Scheduling Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger, Günther R. Raidl. 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12)
  📄 Details

• A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair, Günther R. Raidl. Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I
  📄 Details

• On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem Mario Ruthmair, Günther R. Raidl. Proceedings of the 2nd International Symposium on Combinatorial Optimization
  📄 Details

• Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design Christian Schauer, Günther R. Raidl. Parallel Problem Solving from Nature–PPSN XII
  📄 Details

• A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem Martin Schwengerer, Sandro Pirkwieser, Günther R. Raidl. Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2012
  📄 Details

2011

• A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Martin Berlakovich, Mario Ruthmair, Günther R. Raidl. Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory
  📄 Details

• Hybrid Metaheuristics in Combinatorial Optimization: A Survey Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli. Applied Soft Computing
  📄 Details

• Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques Andreas Chwatal, Günther R. Raidl. Advances in Operations Research
  📄 Details

• A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application Andreas M. Chwatal, Corina Thöni, Karin Oberlechner, Günther R. Raidl. Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS)
  📄 Details

• An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem Bin Hu, Günther R. Raidl. Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory
  📄 Details

• Automatic Generation of 2-AntWars Players with Genetic Programming Johannes Inführ, G\n̈ther R. Raidl. Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory
  📄 Details

• Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints Johannes Inführ, Günther R. Raidl. Network Optimization: 5th International Conference, INOC 2011
  📄 Details

• Variable Neighborhood Search for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl. Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory
  📄 Details

• Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem Markus Leitner, Mario Ruthmair, Günther R. Raidl. Proceedings of the VII ALIO/EURO – Workshop on Applied Combinatorial Optimization
  📄 Details

• Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem Markus Leitner, Mario Ruthmair, Günther R. Raidl. Network Optimization: 5th International Conference, INOC 2011
  📄 Details

• Branch-and-Cut-and-Price for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl. Journal of Mathematical Modelling and Algorithms
  📄 Details

• On Stabilized Branch-and-Price for Constrained Tree Problems Markus Leitner, Mario Ruthmair, Günther R. Raidl.
  📄 Details

• A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables Michael Pimmer, Günther R. Raidl. Proceedings of the 9th Metaheuristics International Conference
  📄 Details

• Improved Packing and Routing of Vehicles with Compartments Sandro Pirkwieser, Günther R. Raidl, Jens Gottlieb. Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory
  📄 Details

• Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments Sandro Pirkwieser, Günther R. Raidl, Jens Gottlieb. Proceedings of the 9th Metaheuristics International Conference
  📄 Details

• Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair, Andreas Hubmer, Günther R. Raidl. Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory
  📄 Details

• A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems Mario Ruthmair, Günther R. Raidl. Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV)
  📄 Details

2010

• A Brief Survey on Hybrid Metaheuristics Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli. Proceedings of BIOMA 2010 – 4th International Conference on Bioinspired Optimization Methods and their Applications
  📄 Details

• Fitting Multi-Planet Transit Models to Photometric Time-Data Series by Evolution Strategies Andreas Chwatal, Günther R. Raidl. GECCO~2010: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation
  📄 Details

• Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization Andreas M. Chwatal, Günther R. Raidl. Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods, GEM~2010
  📄 Details

• The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search Bin Hu, Markus Leitner, Günther R. Raidl. Networks
  📄 Details

• Strong Lower Bounds for a Survivable Network Design Problem Markus Leitner, Günther R. Raidl. ISCO 2010 – International Symposium on Combinatorial Optimization
  📄 Details

• Branch-and-Cut-and-Price for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl.
  📄 Details

• Similarity Searching in Sequences of Complex Events Hannes Obweger, Martin Suntinger, Josef Schiefer, Günther R. Raidl. Proceedings of the Fourth International Conference on Research Challenges in Information Science – RCIS 2010
  📄 Details

• A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem Anna Pagacz, Bin Hu, Günther R. Raidl. 2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design
  📄 Details

• Multilevel Variable Neighborhood Search for Periodic Routing Problems Sandro Pirkwieser, Günther R. Raidl. Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010
  📄 Details

• Matheuristics for the Periodic Vehicle Routing Problem with Time Windows Sandro Pirkwieser, Günther R. Raidl. Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics
  📄 Details

• Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problem Sandro Pirkwieser, Günther R. Raidl. Hybrid Metaheuristics, 7th Int. Workshop, HM 2010
  📄 Details

• The Multidimensional Knapsack Problem: Structure and Algorithms Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy. INFORMS Journal on Computing
  📄 Details

• Metaheuristic Hybrids Günther R. Raidl, Jakob Puchinger, Christian Blum. Handbook of Metaheuristics
  📄 Details

• Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive Günther R. Raidl, Bin Hu. Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010
  📄 Details

• Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair, Günther R. Raidl. Parallel Problem Solving from Nature – PPSN XI, Part II
  📄 Details

• A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents Christian Schauer, Matthias Prandtstetter, Günther R. Raidl. Hybrid Metaheuristics, 7th Int. Workshop, HM 2010
  📄 Details

• Trend-Based Similarity Search in Time-Series Data Martin Suntinger, Hannes Obweger, Josef Schiefer, Philip Limbeck, Günther R. Raidl. Proceedings of the Second International Conference on Advances in Database, Knowledge, and Data Applications – DBKDA 2010
  📄 Details

2009

• Hybrid Metaheuristics Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli. CPAIOR 10th Anniversary
  📄 Details

• Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms Andreas M. Chwatal, Günther R. Raidl. Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)
  📄 Details

• Fitting Multi-Planet Transit Models to CoRoT Time-Data Series by Evolutionary Algorithms Andreas M. Chwatal, Günther Wuchterl, G\n̈ther R. Raidl.
  📄 Details

• Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation Andreas M. Chwatal, Nina Musil, Günther R. Raidl. International Network Optimization Conference 2009
  📄 Details

• Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner. Journal of Mathematical Modelling and Algorithms
  📄 Details

• (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 – Hybridizing Metaheuristics and Mathematical Programming
  📄 Details

• Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem MartinGruber, GüntherR.~Raidl. Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)
  📄 Details

• Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics MartinGruber, GüntherR.~Raidl. Computer Aided Systems Theory – EUROCAST 2009
  📄 Details

• Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances Martin Gruber, Günther R. Raidl. GECCO~2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation
  📄 Details

• A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem Bin Hu, Günther R. Raidl. 9th International Conference on Hybrid Intelligent Systems – HIS~2009
  📄 Details

• Accelerating Column Generation for a Survivable Network Design Problem Markus Leitner, Günther R. Raidl, Ulrich Pferschy. Proceedings of the International Network Optimization Conference 2009
  📄 Details

• A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl. Proceedings of the 8th Metaheuristics International Conference
  📄 Details

• Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl.
  📄 Details

• Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl. Post-Conference Book of the Eight Metaheuristics International Conference – MIC 2009
  📄 Details

• A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows Sandro Pirkwieser, Günther~R. Raidl. Proceedings of the International Network Optimization Conference 2009
  📄 Details

• Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques Sandro Pirkwieser, Günther~R. Raidl. Proceedings of the 8th Metaheuristic International Conference
  📄 Details

• 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
  📄 Details

• A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse Matthias Prandtstetter, Günther R. Raidl, Thomas Misar. Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2009
  📄 Details

• Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents Matthias Prandtstetter, Günther R. Raidl. GECCO~2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation
  📄 Details

• Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouses Ulrike Ritzinger, Matthias Prandtstetter, Günther R. Raidl. Logistik Management: Systeme, Methoden, Integration
  📄 Details

• MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics Jakob Puchinger, Günther R. Raidl, Sandro Pirkwieser. Matheuristics – Hybridizing Metaheuristics and Mathematical Programming
  📄 Details

• Cooperative Hybrids for Combinatorial Optimization Günther R. Raidl. Nature Inspired Cooperative Strategies for Optimization (NICSO 2008)
  📄 Details

• A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair, Günther R. Raidl. Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)
  📄 Details

• 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
  📄 Details

2008

• Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner.
  📄 Details

• Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber, Günther R. Raidl. Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008
  📄 Details

• (Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber, Günther R. Raidl. Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics
  📄 Details

• (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.
  📄 Details

• Effective Neighborhood Structures for the Generalized Traveling Salesman Problem Bin Hu, Günther R. Raidl. Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2008
  📄 Details

• Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem Bin Hu, Günther R. Raidl. Proceedings of the 8th International Conference on Hybrid Intelligent Systems – HIS~2008
  📄 Details

• Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem Bin Hu, Markus Leitner, Günther R. Raidl. Journal of Heuristics
  📄 Details

• Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem Markus Leitner, Günther R. Raidl. Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008
  📄 Details

• 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
  📄 Details

• Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Alfred Mayer, Clemens Nothegger, Andreas M. Chwatal, Günther R. Raidl. Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling
  📄 Details

• 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
  📄 Details

• Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms Sandro Pirkwieser, Günther R. Raidl. GECCO ‘08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation
  📄 Details

• Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees Sandro Pirkwieser, Ruben Ruiz-Torrubiano, Günther R. Raidl. BIRD'08, 2nd International Conference on Bioinformatics Research and Development, Poster Presentations
  📄 Details

• A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows Sandro Pirkwieser, Günther~R. Raidl. Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing
  📄 Details

• An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem Matthias Prandtstetter, Günther R. Raidl. European Journal of Operational Research
  📄 Details

• Combining Forces to Reconstruct Strip Shredded Text Documents Matthias Prandtstetter, Günther R. Raidl. Hybrid Metaheuristics 2008
  📄 Details

• Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search Jakob Puchinger, Günther R. Raidl. Journal of Heuristics
  📄 Details

• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization Günther R. Raidl, Jakob Puchinger. Hybrid Metaheuristics – An Emergent Approach for Combinatorial Optimization
  📄 Details

• A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Günther R. Raidl, Martin Gruber. Numerical Analysis and Applied Mathematics
  📄 Details

2007

• Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem Andreas Chwatal, Günther R. Raidl, Olivia Dietzel. Proceedings of MIC2007, the 7th Metaheuristics International Conference
  📄 Details

• Determining Orbital Elements of Extrasolar Planets by Evolution Strategies Andreas M. Chwatal, Günther R. Raidl. Computer Aided Systems Theory – EUROCAST 2007
  📄 Details

• CyMATE: A New Tool for Methylation Analysis of Plant Genomic DNA after Bisulfite Sequencing Jennifer Hetzl, Andrea M. Foerster, Günther R. Raidl, Ortrun Mittelsten Scheid. The Plant Journal
  📄 Details

• The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search Bin Hu, Markus Leitner, Günther R. Raidl.
  📄 Details

• Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem Markus Leitner, Bin Hu, Günther R. Raidl. Proceedings of the International Network Optimization Conference 2007
  📄 Details

• Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger. Evolutionary Computation in Combinatorial Optimization – EvoCOP~2007
  📄 Details

• A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger.
  📄 Details

• The Multidimensional Knapsack Problem: Structure and Algorithms Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy.
  📄 Details

• Models and Algorithms for Three-Stage Two-Dimensional Bin Packing Jakob Puchinger, Günther R. Raidl. European Journal of Operational Research
  📄 Details

• Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem Günther R. Raidl, Andreas Chwatal. Numerical Analysis and Applied Mathematics
  📄 Details

• 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. Operations Research Proceedings 2006
  📄 Details

• A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks Daniel Wanger, Ulrich Pferschy, Petra Mutzel, Günther R. Raidl, P.Bachhiesl. Proceedings of the International Network Optimization Conference 2007
  📄 Details

2006

• Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO Martin Gruber, Jano van Hemert, Günther R. Raidl. Proceedings of the Genetic and Evolutionary Computation Conference – GECCO 2006
  📄 Details

• Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem Bin Hu, Markus Leitner, Günther R. Raidl.
  📄 Details

• Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering Bin Hu, Günther R. Raidl. Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics
  📄 Details

• Cleaning of Raw Peptide MS/MS Spectra: Improved Protein Identification Following Deconvolution of Multiply Charged Peaks, Isotope Clusters, and Removal of Background Noise Nedim Mujezinovic, G"n̆ther R. Raidl, James R. A. Hutchins, Jan-Michael Peters, Karl Mechtler, Frank Eisenhaber. Proteomics
  📄 Details

• Evolutionary Approach to Constrained Minimum Spanning Tree Problem Anna Pagacz, Günther R. Raidl, Stanislaw Zawiślak. Evolutionary Computation and Global Optimization 2006
  📄 Details

• The Core Concept for the Multidimensional Knapsack Problem Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy. Evolutionary Computation in Combinatorial Optimization – EvoCOP~2006
  📄 Details

• Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search Jakob Puchinger, Günther R. Raidl.
  📄 Details

• Biased Mutation Operators for Subgraph-Selection Problems Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom. IEEE Transactions on Evolutionary Computation
  📄 Details

• A Unified View on Hybrid Metaheuristics Günther R. Raidl. Proceedings of the Hybrid Metaheuristics Workshop
  📄 Details

2005

• A New 0–1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber, Günther R. Raidl. Proceedings of the 2nd International Network Optimization Conference 2005
  📄 Details

• Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber, Günther R. Raidl. Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search
  📄 Details

• Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search Bin Hu, Markus Leitner, Günther R. Raidl. Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search
  📄 Details

• A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem Matthias Prandtstetter, Günther R. Raidl. Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search
  📄 Details

• An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem Matthias Prandtstetter, Günther R. Raidl.
  📄 Details

• Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification Jakob Puchinger, Günther R. Raidl. Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Part II
  📄 Details

• Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem Jakob Puchinger, Günther R. Raidl, Martin Gruber. Proceedings of MIC2005, the 6th Metaheuristics International Conference
  📄 Details

• Relaxation Guided Variable Neighborhood Search Jakob Puchinger, Günther R. Raidl. Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search
  📄 Details

• 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. Evolutionary Computation Journal
  📄 Details

• Evolutionary Computation: An Overview and Recent Trends Günther R. Raidl. ̈OGAI Journal
  📄 Details

2004

• Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem G.W.~Klau, I.~Ljubić, A.~Moser, P.~Mutzel, P.~Neuner, U.~Pferschy, G.~Raidl, R.~Weiskircher. Genetic and Evolutionary Computation – GECCO 2004
  📄 Details

• An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem Gabriele Koller, Günther R. Raidl. Parallel Problem Solving from Nature – PPSN~VIII
  📄 Details

• Solving a Real-World Glass Cutting Problem Jakob Puchinger, Günther R. Raidl, Gabriele Koller. Evolutionary Computation in Combinatorial Optimization – EvoCOP~2004
  📄 Details

• An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing Jakob Puchinger, Günther R. Raidl. Parallel Problem Solving from Nature – PPSN~VIII
  📄 Details

• Models and Algorithms for Three-Stage Two-Dimensional Bin Packing Jakob Puchinger, Günther R. Raidl.
  📄 Details

• An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem G. R. Raidl, H. Feltl. Proceedings of the 2003 ACM Symposium on Applied Computing
  📄 Details

• 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.
  📄 Details

• Biased Mutation Operators for Subgraph-Selection Problems Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom.
  📄 Details

2003

• A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem B. A. Julstrom, G. R. Raidl. in 2003 Genetic and Evolutionary Computation Conference’s Workshops Proceedings, Workshop on Analysis and Design of Representations
  📄 Details

• A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs I. Ljubić, G. R. Raidl. Journal of Heuristics
  📄 Details

• Edge-Sets: An Effective Evolutionary Coding of Spanning Trees G. R. Raidl, B. A. Julstrom. IEEE Transactions on Evolutionary Computation
  📄 Details

• Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem G. R. Raidl, B. A. Julstrom. Proceedings of the 2003 ACM Symposium on Applied Computing
  📄 Details

• Hybrid Evolutionary Algorithms for Combinatorial Optimization G. R. Raidl.
  📄 Details

2002

• Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges B. A. Julstrom, G. R. Raidl. Proceedings of the 2002 ACM Symposium on Applied Computing
  📄 Details

• A Memetic Algorithm for Vertex-Biconnectivity Augmentation S. Kersting, G. R. Raidl, I. Ljubić. Applications of Evolutionary Computing: EvoWorkshops 2002
  📄 Details

• Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem G. R. Raidl, I. Ljubić. Information Processing Letters
  📄 Details

• On Weight-Biased Mutation for Graph Problems Günther R. Raidl, Gabriele Kodydek, Bryant Julstrom. Parallel Problem Solving from Nature – PPSN VII
  📄 Details

• Letting Ants Labeling Point Features M. Schreyer, G. R. Raidl. Proceedings of the 2002 IEEE Congress on Evolutionary Computation
  📄 Details

2001

• Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search J. Gottlieb, B. A. Julstrom, F. Rothlauf, G. R. Raidl. Proceedings of the 2001 Genetic and Evolutionary Computation Conference
  📄 Details

• Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems B. A. Julstrom, G. R. Raidl. Proceedings of the 16th ACM Symposium on Applied Computing
  📄 Details

• An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem I. Ljubić, G. R. Raidl. Applications of Evolutionary Computing: EvoWorkshops 2001
  📄 Details

2000

• The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search Jens Gottlieb, Günther R. Raidl. Proceedings of the 2000 Genetic and Evolutionary Computation Conference
  📄 Details

• A Hybrid GA for the Edge-Biconnectivity Augmentation Problem I. Ljubić, G. R. Raidl, J. Kratica. Parallel Problem Solving from Nature – PPSN VI
  📄 Details

• A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Günther R. Raidl, Bryant A. Julstrom. Proceedings of the 2000 ACM Symposium on Applied Computing
  📄 Details

• A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem G. R. Raidl, C. Drexel. Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference
  📄 Details

• An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem G. R. Raidl. Proceedings of the 2000 IEEE Congress on Evolutionary Computation
  📄 Details

1999

• Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem Jens Gottlieb, Günther R. Raidl. Proceedings of Artificial Evolution: Fourth European Conference
  📄 Details

• A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem Günther R. Raidl. Proceedings of the 1999 ACM Symposium on Applied Computing
  📄 Details

• Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem Günther R. Raidl. Proceedings of the 1999 IEEE Congress on Evolutionary Computation
  📄 Details

• An Evolutionary Approach to Point-Feature Label Placement Günther R. Raidl. Proceedings of the 1999 Genetic and Evolutionary Computation Conference
  📄 Details

• On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms Günther R. Raidl, Jens Gottlieb. Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference
  📄 Details

• The Multiple Container Packing Problem: A Genetic Algorithm Approach with Weighted Codings Günther R. Raidl. ACM SIGAPP Applied Computing Review
  📄 Details

1998

• Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks Günther R. Raidl, Gabriele Kodydek. Proceedings of the International ICSC/IFAC Symposium on Neural Computation
  📄 Details

• Genetic Algorithms for the Multiple Container Packing Problem Günther R. Raidl, Gabriele Kodydek. Proceedings of the 5th International Conference on Parallel Problem Solving from Nature – PPSN V
  📄 Details

• An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problem Günther R. Raidl. Proceedings of the 5th IEEE International Conference on Evolutionary Computation
  📄 Details

• A Hybrid GP Approach for Numerically Robust Symbolic Regression Günther R. Raidl. Proceedings of the 3rd Annual Genetic Programming Conference
  📄 Details

• Approximation with Evolutionary Optimized Tensor Product Bernstein Polynomials Günther R. Raidl, Christian Wurm. Proceedings of the International Conference on Artificial Intelligence in Industry: From Theory to Practice
  📄 Details

• A Genetic Algorithm for Labeling Point Features Günther R. Raidl. Proceedings of the International Conference on Imaging Science, Systems and Technology
  📄 Details

• Transforming an Analytically Defined Color Space to Match Psychophysically Gained Color Distances Ingeborg Tastl, Günther R. Raidl. Proceedings of the SPIE’s 10th International Symposium on Electronic Imaging: Science and Technology
  📄 Details

1994

• Progressives, adaptives Ray-Tracing von Bildern mit hoher zeitlicher Kohärenz Günther Raidl.
  📄 Details

• Parallel Beam Search for Combinatorial Optimization Frohner, Nikolaus, Gmys, Jan, Melab, Nourdine,, Raidl, Günther, Talbi, El-ghazali. Workshop Proceedings of the International Conference on Parallel Processing (ICPP 2022)
  📄 Details