Publications: Günther Raidl
2026
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.
Proceedings of the 12th International Network Optimization Conference, INOC 2026, Liège, Belgium (Fortz, Bernard), pages 17-20, 2026, OpenProceedings.org.
[pdf] [doi] [details]
Complexity of Positive Influence Domination on Partial Grids
Iurlano, Enrico, Raidl, Günther R.
Fundamentals of Computation Theory—25th International Symposium (Jeż, Artur and Otop, Jan), volume 16106 of LNCS, pages 267-280, 2026, Springer.
[pdf] [doi] [details]
The Graph Burning Problem under Constrained Diffusion
Iurlano, Enrico, Raidl, Günther R., Djukanović, Marko
Advances in Optimization and Wildfire (Alvelos, Filipe and Martins, Isabel and Rocha, Ana Maria A. C.), pages 139-154, 2026, Springer.
[pdf] [doi] [details]
A Construct Merge Solve and Adapt Heuristic for Least Cost Influence Maximization
Odelga, Felix, Iurlano, Enrico, Raidl, Günther R.
pages 1-15, 2026.
Note: preprint accepted for MIC 2026
[pdf] [details]
Superstrings of Uniform-Cardinality Set Systems via the Generalized Traveling Salesperson Problem
Weissenfels, Alexander, Iurlano, Enrico, Raidl, Günther R.
pages 1-15, 2026.
Note: preprint
[pdf] [details]
A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs
Wustinger, Martin, Iurlano, Enrico, Raidl, Günther R.
Evolutionary Computation in Combinatorial Optimization (Krejca, Martin S. and Pillay, Nelishia), volume 16522 of LNCS, pages 133-149, 2026, Springer.
[pdf] [doi] [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 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 211-220, 2025, Springer.
[pdf] [doi] [details]
Revisiting Large Neighborhood Search with On-the-Fly Charging Station Insertion for the Electric Autonomous Dial-a-Ride Problem
Bresich, Maria, Raidl, Günther R., Limmer, Steffen
ACM Transactions on Evolutionary Learning and Optimization, 2025, Association for Computing Machinery.
Note: Just Accepted
[pdf] [doi] [details]
Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime
Frohner, Nikolaus, Raidl, Günther R.
Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 263-271, 2025, Springer.
[pdf] [doi] [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), pages 1-8, 2025, IEEE.
[pdf] [doi] [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 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 236-250, 2025, Springer.
[pdf] [doi] [details]
Tackling the Alpha-Domination Problem Heuristically
Iurlano, Enrico, Varga, Johannes, Raidl, Günther R.
Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 148-156, 2025, Springer.
[pdf] [doi] [details]
SAT-Based Search for Minwise Independent Families
Iurlano, Enrico, Raidl, Günther R.
2025.
Note: preprint
[pdf] [doi] [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 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 251-262, 2025, Springer.
[doi] [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 (Dorronsoro, Bernabé and Ellaia, Rachid and Talbi, El-Ghazali), pages 3-20, 2024, Springer.
[pdf] [doi] [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, pages 142-150, 2024, Association for Computing Machinery.
Note: best paper award winner of ECOM track
[pdf] [doi] [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 (Dorronsoro, Bernabé and Ellaia, Rachid and Talbi, El-Ghazali), volume 2016 of CCIS, pages 28-43, 2024, Springer.
[pdf] [doi] [details]
Signed double Roman domination on cubic graphs
Iurlano, Enrico, Zec, Tatjana, Djukanović, Marko, Raidl, Günther R.
Applied Mathematics and Computation, volume 471, pages 128612, 2024, Elsevier.
[pdf] [doi] [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, 2024.
Note: early access
[doi] [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 (T. Stützle and M. Wagner), volume 14632 of LNCS, pages 1-15, 2024, Springer.
Note: best paper award winner
[pdf] [doi] [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, 2024.
[doi] [details]
Selecting User Queries in Interactive Job Scheduling
Varga, Johannes, Raidl, Günther R., Todemann, Tobias
19th International Conference on Computer Aided Systems Theory, 2024, Springer.
Note: to appear
[pdf] [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. (Nicosia, Giuseppe and Ojha, Varun and La Malfa, Emanuele and La Malfa, Gabriele and Pardalos, Panos M. and Umeton Renato), volume 14505 of lNCS, pages 24-38, 2024, Springer.
[pdf] [doi] [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, 2024.
[doi] [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 (Pérez Cáceres, Leslie and Stützle, Thomas), volume 13987 of LNCS, pages 130-145, 2023, Springer.
Note: best paper award winner
[pdf] [doi] [details]
Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines
Nikolaus Frohner, Günther R. Raidl, Francisco Chicano
pages 1941-1949, 2023, ACM Press.
[doi] [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 (Roberto Moreno-Díaz and Franz Pichler and Alexis Quesada-Arencibia), volume 13789 of LNCS, pages 87-95, 2023, Springer.
[pdf] [doi] [details]
A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning
Jatschka, Thomas and Rodemann, Tobias and Raidl, Günther R.
Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres and Thomas Stützle), volume 13987 of LNCS, pages 50–65, 2023, Springer.
[pdf] [doi] [details]
Optimizing the positions of battery swapping stations – Pilot Studies and Layout Optimization Algorithm
Rodemann, Tobias and Kataoka, Hiroaki and Jatschka, Thomas and Raidl, Günther R. and Limmer, Steffen and Meguro Hiromu
Proceedings to the 6th International Electric Vehicle Technology Conference, pages 20231015, 2023, JSAE.
[pdf] [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 (Correia, J. and Smith, S. and Qaddoura, R.), volume 13989 of LNCS, pages 3-18, 2023, Springer.
[pdf] [doi] [details]
Large Neighborhood Search for Electric Vehicle Fleet Scheduling
Limmer, Steffen, Varga, Johannes, Raidl, Günther R.
Energies, volume 16, number 12, 2023.
[pdf] [doi] [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 (Dorronsoro, B. and Chicano, F. and Danoy, G. and Talbi, E.-G.), volume 1824 of Communications in Computer and Information Science, pages 236-247, 2023, Springer.
[pdf] [doi] [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, volume 122, pages 108844, 2022.
[pdf] [doi] [details]
Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime
N. Frohner, G. R. Raidl
Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia and others), pages 20-21, 2022.
[pdf] [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), pages 273-275, 2022, AAAI.
[pdf] [doi] [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 (Nicosia, Giuseppe and Ojha, Varun and La Malfa, Emanuele and La Malfa, Gabriele and Jansen, Giorgio and Pardalos, Panos M. and Giuffrida, Giovanni and Umeton, Renato), volume 13164 of LNCS, pages 283-298, 2022, Springer.
[pdf] [doi] [details]
A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems
Huber, Marc, Raidl, Günther R.
Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia and others), pages 22-23, 2022.
[pdf] [details]
A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications
Jatschka, Thomas and Rodemann, Tobias and Raidl, Günther R.
Metaheuristics and Nature Inspired Computing (Dorronsoro, Bernabé and Yalaoui, Farouk and Talbi, El-Ghazali and Danoy, Grégoire), volume 1541 of CCIS, pages 3-17, 2022, Springer.
[pdf] [details]
A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters
Jatschka, Thomas and Rauscher, Matthias and Kreutzer, Bernhard and Rodemann, Tobias and Raidl, Günther R.
Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (Alexis Quesada-Arencibia and others), pages 32-33, February 2022.
[pdf] [details]
A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters
Jatschka, Thomas and Rauscher, Matthias and Kreutzer, Bernhard and Okamoto, Yusuke and Rodemann, Tobias and Raidl, Günther R.
Chapter in Computer Aided Systems Theory – EUROCAST 2022, volume 13789 of LNCS, pages 121-129, 2022, Springer.
[pdf] [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 – EvoCOP 2022 (Pérez Cáceres, Leslie and Verel, Sébastien), volume 13222 of LNCS, pages 127-142, 2022, Springer.
Note: best paper award winner
[pdf] [doi] [details]
A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
Jonas Mayerhofer and Markus Kirchweger and Marc Huber and Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization - 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, Proceedings (Leslie Pérez Cáceres and Sébastien Vérel), volume 13222 of Lecture Notes in Computer Science, pages 127-142, 2022, Springer.
[pdf] [doi] [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 (Schaus, Pierre), volume 13292 of LNCS, pages 300-317, 2022, Springer.
[pdf] [doi] [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, volume 10, 2022.
[pdf] [doi] [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) (Peter J. Stuckey), volume 12735 of LNCS, pages 283-298, 2021, Springer.
[pdf] [doi] [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
2021, Technical report AC-TR-21-008, Algorithms and Complexity Group, TU Wien.
[pdf] [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), volume 180 of Procedia Computer Science, pages 366-370, 2021.
[pdf] [doi] [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, volume 302, pages 477-501, 2021.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-19-002.pdf
[pdf] [doi] [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, volume 126, number 105125, 2021.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-18-011a.pdf
[doi] [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), volume 180 of Procedia Computer Science, pages 517-524, 2021.
[pdf] [doi] [details]
Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems
M. Horn, Günther R. Raidl
17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey), volume 12735 of LNCS, pages 72-88, 2021, Springer.
[pdf] [doi] [details]
A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
Thomas Jatschka, Günther R. Raidl, Tobias Rodemann
Algorithms, volume 14, number 8, pages 232, 2021.
[pdf] [doi] [details]
Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers
Schaden, Benjamin, Jatschka, Thomas, Limmer, Steffen, Raidl, Günther R.
Energies, volume 14, number 22, 2021.
[pdf] [doi] [details]
A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
Thomas Jatschka, Günther Raidl, Tobias Rodemann
2021, Technical report AC-TR-21-006, Algorithms and Complexity Group, TU Wien.
[pdf] [details]
Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers
Benjamin Schaden, Thomas Jatschka, Steffen Limmer, Günther Raidl
2021, Technical report AC-TR-21-014, Algorithms and Complexity Group, TU Wien.
[pdf] [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, volume 302, pages 407-531, 2021.
[pdf] [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
2021, Technical report AC-TR-21-009, Algorithms and Complexity Group, TU Wien.
[pdf] [details]
Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings
Nikolic, Bojan, Kartelj, Aleksandar, Djukanovic, Marko, Grbić, Milana, Blum, Christian, Raidl, Günther
Mathematics, volume 9, number 13, 2021.
[pdf] [doi] [details]
2020
Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem
Christian Blum, Marko Djukanovic, Alberto Santini and Hua Jiang, Chu-Min Li, Felipe Manya, Günter R. Raidl
Computers & Operations Research, volume 125, number 105089, 2020.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf
[pdf] [doi] [details]
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
2020, Technical report AC-TR-20-003, Algorithms and Complexity Group, TU Wien.
[pdf] [details]
An A Search Algorithm for the Constrained Longest Common Subsequence Problem*
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
2020, Technical report AC-TR-20-004, Algorithms and Complexity Group, TU Wien.
[pdf] [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 (Nicosia, Giuseppe and Pardalos, Panos and Giuffrida, Giovanni and Umeton, Renato and Sciacca, Vincenzo), volume 11943 of LNCS, pages 154-167, 2020, Springer.
[pdf] [doi] [details]
Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther R. Raidl, Christian Blum
Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier.
[doi] [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, volume 166, number 106041, 2020.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf
[pdf] [doi] [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 (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 55-79, 2020, Springer.
[pdf] [doi] [details]
Finding Longest Common Subsequences: New anytime A$^*$ Search Results
Marko Djukanovic, Günther R. Raidl, Christian Blum
Applied Soft Computing, volume 95, number 106400, 2020.
[pdf] [details]
Casual Employee Scheduling with Constraint Programming and Metaheuristics
Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz and Franz Pichler and Alexis Quesada-Arencibia), volume 12013 of LNCS, pages 279-287, 2020, Springer.
[pdf] [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 (Giuseppe Nicosia and Panos Pardalos and Renato Umeton and Giovanni Giuffrida and Vincenzo Sciacca), volume 11943 of LNCS, pages 445-457, 2020, Springer.
[pdf] [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 (Luís Paquete and Christine Zarges), volume 12102 of LNCS, pages 67-82, 2020, Springer.
[pdf] [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 (Patrick De Causmaecker and Ender Özcan and Greet Vanden Berghe), 2020.
[pdf] [details]
Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem
Matthias Horn, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz and Franz Pichler and Alexis Quesada-Arencibia), volume 12013 of LNCS, pages 344-351, 2020, Springer.
[pdf] [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 (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 134-149, 2020, Springer.
[doi] [details]
A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources
Jatschka, Thomas and Rodemann, Tobias and Raidl, Günther R.
09 2020, Presentation, CPAIOR2020.
[pdf] [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, volume 12013 of LNCS, pages 255-262, 2020, Springer.
[pdf] [details]
Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
Jatschka, Thomas and Rodemann, Tobias and Raidl, Günther R.
Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia and Panos Pardalos and Renato Umeton and Giovanni Giuffrida and Vincenzo Sciacca), volume 11943 of LNCS, pages 738-750, 2020, Springer.
[pdf] [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 (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 150-165, 2020, Springer.
[pdf] [doi] [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 (Bäck, Thomas and Preuss, Mike and Deutz, André and Wang, Hao and Doerr, Carola and Emmerich, Michael and Trautmann, Heike), volume 12270 of LNCS, pages 385-398, 2020, Springer.
[doi] [details]
A Model for Finding Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Discrete Applied Mathematics, volume 228, pages 242-264, 2020.
[pdf] [doi] [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, volume 380, number 125233, 2020.
[pdf] [doi] [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, January 2020.
[pdf] [doi] [details]
2019
A Memetic Algorithm for Competitive Facility Location Problems
Benjamin Biesinger, Bin Hu, Günther R. Raidl
Chapter in Business and Consumer Analytics: New Ideas, pages 637-660, 2019, Springer.
[pdf] [details]
Finding Longest Common Subsequences: New A Anytime Results*
Marko Djukanovic, Günther R. Raidl, Christian Blum
2019, Technical report AC-TR-19-008, Algorithms and Complexity Group, TU Wien.
[pdf] [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, volume 11353 of LNCS, pages 199-214, 2019, Springer.
[doi] [details]
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem
Marko Djukanovic , Günther R. Raidl, Christian Blum
Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory (EUROCAST 2019), 2019.
Note: accepted for presentation
[pdf] [details]
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem
Djukanovic, Marko, Raidl, Günther R., Blum, Christian
Proceedings of EUROCAST 2019 – 17th International Conference on Computer Aided Systems Theory (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 12013 of LNCS, pages 429-437, 2019, Springer.
[doi] [details]
Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization
Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl
Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia and others), pages 78-79, 2019.
[pdf] [details]
Towards Improving Merging Heuristics for Binary Decision Diagrams
Nikolaus Frohner, Günther R. Raidl
Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis and Yannis Marinakis and Panos Pardalos), volume 11968 of LNCS, pages 30-45, 2019, Springer.
[pdf] [details]
Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem
Matthias Horn, Günther R. Raidl
Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia and others), pages 94-95, 2019.
[pdf] [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, volume 277, number 103173, 2019.
[doi] [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 (Liu, Jixue and Bailey, James), volume 11919 of LNCS, pages 549-560, 2019, Springer.
[doi] [details]
A Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources*
Matthias Horn, Günther Raidl, Elina Rönnberg
2019, Technical report AC-TR-19-002, Algorithms and Complexity Group, TU Wien.
[pdf] [details]
A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
Jatschka, Thomas and Rodemann, Tobias and Raidl, Günther R.
Evolutionary Computation in Combinatorial Optimization (Liefooghe, Arnaud and Paquete, Luís), volume 11452 of LNCS, pages 1-16, 2019, Springer.
[pdf] [details]
VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points
Jatschka, Thomas and Rodemann, Tobias and Raidl, Günther R.
Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia and others), pages 70-71, February 2019.
[pdf] [details]
A SAT Approach for Finding Sup-Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Learning and Intelligent Optimization. LION~2019, volume 11968 of LNCS, pages 325-341, 2019, Springer.
[pdf] [details]
A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
2019, Technical report AC-TR-19-007, Algorithms and Complexity Group, TU Wien.
[pdf] [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 (Nikolaos F. Matsatsinis, and Yannis Marinakis and Panos Pardalos), volume 11968 of LNCS, pages 184-200, 2019, Springer.
[pdf] [doi] [details]
Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources
Johannes Maschler, Günther Raidl
2019, Technical report AC-TR-19-003, Algorithms and Complexity Group, TU Wien.
[pdf] [details]
Metaheuristic Hybrids
Günther R. Raidl, Jakob Puchinger, Christian Blum
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), pages 385-417, 2019, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-19.pdf
[details]
Strategies for Iteratively Refining Layered Graph Models
Martin Riedler, Mario Ruthmair, Günther R. Raidl
Hybrid Metaheuristics: 11th International Workshop, HM 2019 (Blesa Aguilera, M. J. and Blum, C. and Gambini Santos, H. and Pinacho-Davidson, P. and Godoy del Campo, J.), volume 11299 of LNCS, pages 46-62, 2019, Springer.
[doi] [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, volume 52, number 3, pages 673-690, 2018.
Note: previous technical report available at https://www.ac.tuwien.ac.at/files/tr/ac-tr-16-001.pdf
[details]
Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther Raidl, Christian Blum
2018, Technical report AC-TR-18-012, Algorithms and Complexity Group, TU Wien.
[pdf] [details]
GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection
Airam Expósito, Günther R. Raidl, Julio Brito and José A. Moreno-Pérez
Computer Aided Systems Theory – EUROCAST 2017, Part I (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 10671 of LNCS, pages 299-306, 2018, Springer.
[pdf] [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, pages 235-256, 2018.
[pdf] [details]
A-Based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem*
Matthias Horn, Johannes Maschler, Günther Raidl, Elina Rönnberg
2018, Technical report AC-TR-18-011, Algorithms and Complexity Group, TU Wien.
[pdf] [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 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 10671 of LNCS, pages 355-363, 2018, Springer.
[pdf] [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 (Giuffrida, Giovanni and Nicosia, Giuseppe and Pardalos, Panos and Umeton, Renato), volume 10710 of LNCS, pages 527-539, 2018, Springer.
[pdf] [details]
A Model for Finding Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther Raidl
2018, Technical report AC-TR-18-009, Algorithms and Complexity Group, TU Wien.
[pdf] [details]
A SAT Approach for Finding Sup-Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther Raidl
2018, Technical report AC-TR-18-010, Algorithms and Complexity Group, TU Wien.
[pdf] [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, pages 375-397, 2018.
[pdf] [details]
Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments
Johannes Maschler, Günther Raidl
2018, Technical report AC-TR-18-005, Algorithms and Complexity Group, TU Wien.
[pdf] [details]
Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition
Martin Riedler, Günther Raidl
Computers & Operations Research, volume 96, pages 30-54, 2018.
[pdf] [doi] [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), pages 1-10, 2018.
[pdf] [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 (Karl Franz Dörner and Ivana Ljubić and Georg Pflug and Gernot Tragler), pages 385-391, 2017, Springer.
[pdf] [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 and José A. Moreno-Pérez
Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory – EUROCAST 2017 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), 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 (Giuffrida, Giovanni and Nicosia, Giuseppe and Pardalos, Panos and Umeton, Renato), volume 10710 of LNCS, pages 506-518, 2017, Springer.
[pdf] [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 (Hu, Bin and López-Ibáñez, Manuel), volume 10197 of LNCS, pages 91-107, 2017, Springer.
[pdf] [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) (Quesada-Arencibia, Alexis and Rodríguez, José Carlos and Moreno-D\áz, Roberto), pages 104-105, 2017.
[pdf] [details]
Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition
Kloimüllner, Christian, Raidl, G\n̈ther R.
Networks, volume 69, number 3, pages 270-289, 2017.
Note: previous technical report available at https://www.ac.tuwien.ac.at/files/pub/kloimuellner-17a.pdf
[pdf] [doi] [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) (Roberto Battiti and Dmitri Kvasov and Yaroslav Sergeyev), volume 10556 of LNCS, pages 1-16, 2017, Springer.
[pdf] [doi] [details]
Large Neighborhood Search for the Most Strings with Few Bad Columns Problem
Evelia Lizárraga, Maria J. Blesa, Christian Blum and Günther R. Raidl
Soft Computing, volume 21, number 17, pages 4901-4915, 2017.
[pdf] [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) (Quesada-Arencibia, Alexis and Rodríguez, José Carlos and Moreno-D\áz, Roberto), pages 106-107, 2017.
[pdf] [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 (Karl Franz Dörner and Ivana Ljubić and Georg Pflug and Gernot Tragler), pages 393-399, 2017, Springer.
[pdf] [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, volume 33, number 3, pages 365-371, 2017.
[pdf] [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
2017, Technical report AC-TR-17-001, Algorithms and Complexity Group, TU Wien.
[pdf] [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, volume 76, number 1, pages 93-119, 2016, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/biesinger-14b.pdf
[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, volume 52, pages 245-252, 2016.
Note: INOC 2015 – 7th International Network Optimization Conference
[pdf] [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
2016, Technical report AC-TR-16-001, Algorithms and Complexity Group, TU Wien.
[pdf] [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, volume 10, number 1, pages 189-205, 2016.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/blum-15.pdf
[details]
Hybrid Metaheuristics – Powerful Tools for Optimization
Christian Blum, Günther R. Raidl
2016, Springer.
[pdf] [details]
A Memetic Algorithm for the Virtual Network Mapping Problem
Johannes Inführ, Günther Raidl
Journal of Heuristics, volume 22, number 4, pages 475-505, 2016.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/infuehr-14.pdf
[doi] [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 (Maria J. Blesa and Christian Blum and Angelo Cangelosi and Vicenzo Cutello and Alessandro Di Nuovo and Mario Pavone and El-Ghazali Talbi), volume 9668 of LNCS, pages 1-16, 2016, Springer.
[pdf] [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, pages 223-244, 2016.
[pdf] [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 (Maria J. Blesa and Christian Blum and Angelo Cangelosi and Vicenzo Cutello and Alessandro Di Nuovo and Mario Pavone and El-Ghazali Talbi), volume 9668 of LNCS, pages 87-103, 2016, Springer.
[pdf] [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 (T. Stützle and V. Maniezzo), pages 104-107, 2016.
[pdf] [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, volume 22, number 4, pages 359-363, 2016.
[pdf] [doi] [details]
Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition
Martin Riedler, Günther Raidl
2016, Technical report AC-TR-16-007, Algorithms and Complexity Group, TU Wien.
[pdf] [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, volume 52, pages 189-196, 2016.
Note: INOC 2015 – 7th International Network Optimization Conference
[pdf] [doi] [details]
2015
A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles
Bacher, Christopher, Raidl, Günther R.
Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia and others), pages 119-120, 2015.
[pdf] [details]
A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles
Christopher Bacher, Günther R. Raidl, Thorsten Krenek
Computer Aided Systems Theory – EUROCAST 2015 (Moreno-Díaz, Roberto and others), volume 9520 of LNCS, pages 425-432, 2015, Springer International Publishing Switzerland.
[pdf] [details]
Numerische Optimierung elektrifizierter Antriebsstränge
Krenek, Thorsten, Bacher, Christopher, Lauer, Thomas, Raidl, Günther R.
Motortechnische Zeitschrift (MTZ), volume 03, pages 66-74, March 2015, Springer.
[details]
Numerical Optimisation of Electro-Hybrid Powertrains
Krenek, Thorsten, Bacher, Christopher, Lauer, Thomas, Raidl, Günther R.
MTZ Worldwide, volume 03, pages 46-52, March 2015, Springer.
[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, volume 21, number 3, pages 391-431, 2015, Springer US.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/biesinger-14.pdf
[doi] [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 (Ochoa, Gabriela and Chicano, Francisco), volume 9026 of LNCS, pages 48-60, 2015, Springer.
[pdf] [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, pages 89/1-89/9, 2015.
[pdf] [details]
Heuristic Approaches for the Probabilistic Traveling Salesman Problem
Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl
Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia and others), pages 99 - 100, 2015.
[pdf] [details]
Heuristic Approaches for the Probabilistic Traveling Salesman Problem
Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2015 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 9520 of LNCS, pages 342-349, 2015, Springer International Publishing Switzerland.
[pdf] [doi] [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), volume 47 of Electronic Notes in Discrete Mathematics, pages 133-140, 2015, Elsevier.
[pdf] [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, volume 9520 of LNCS, pages 384-392, 2015, Springer.
[pdf] [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) (Alexis Quesada-Arencibia and José Carlos Rodriguez and Roberto Moreno-Díaz jr. and Roberto Moreno-D\áz), pages 109-110, 2015.
[pdf] [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, volume 23, number 1, pages 89-113, 2015.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/hiermann-13.pdf
[details]
A New Solution Representation for the Firefighter Problem
Bin Hu, Andreas Windbichler, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2015 (Ochoa, Gabriela and Chicano, Francisco), volume 9026 of LNCS, pages 25-35, 2015, Springer.
[pdf] [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) (Alexis Quesada-Arencibia and José Carlos Rodriguez and Roberto Moreno-Díaz jr. and Roberto Moreno-D\áz), pages 125-126, 2015.
[pdf] [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) (David Camacho and others), pages 1-8, 2015, IEEE Xplore.
[pdf] [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, volume 9520 of LNCS, pages 401-408, 2015, Springer.
[details]
Decomposition Based Hybrid Metaheuristics
Günther R. Raidl
European Journal of Operational Research, volume 244, pages 66-76, 2015.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-15.pdf
[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, volume 63, number 3, pages 597-629, 2015, Springer.
[pdf] [doi] [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, volume 9520 of LNCS, pages 279-285, 2015, Springer.
[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), volume 8994 of LNCS, pages 186-201, 2015, Springer.
[details]
2014
Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles
Bacher, Christopher, Krenek, Thorsten, Raidl, Günther R.
Chapter in Applications of Evolutionary Computation (Esparcia-Alcázar, Anna I. and Mora, Antonio M.), pages 553-564, 2014, Springer.
[pdf] [doi] [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), volume 8426 of LNCS, pages 203-217, 2014, Springer.
[pdf] [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 (Maria J. Blesa and Christain Blum and Stefan Voß), volume 8457 of LNCS, pages 85-99, 2014, Springer.
[pdf] [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 (S. Lakusic and others), pages 691-696, 2014, Department of Transportation, University of Zagreb.
[pdf] [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, volume 47 of Electronic Notes in Discrete Mathematics, pages 141-148, 2014, Elsevier.
[pdf] [details]
Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case
Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther~R.Raidl2014* (Blum, Christian and Ochoa, Gabriela), volume 8600 of LNCS, pages 73-84, 2014, Springer.
*Evolutionary Computation in Combinatorial Optimization – EvoCOP
[pdf] [doi] [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 (Bartz-Beielstein, Thomas and Branke, Jürgen and Filipic, Bogdan and Smith, Jim), volume 8672 of LNCS, pages 792-801, 2014, Springer.
[pdf] [doi] [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 (Maria J. Blesa and Christain Blum and Stefan Voß), volume 8457 of LNCS, pages 183-197, 2014, Springer.
[pdf] [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, volume 47 of Electronic Notes in Discrete Mathematics, pages 149-156, 2014, Elsevier.
[pdf] [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, pages 226-228, 2013.
[pdf] [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 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 8111 of LNCS, pages 380-387, 2013, Springer.
[pdf] [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, pages 200-202, 2013.
[pdf] [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, pages 118-125, 2013, IEEE.
[pdf] [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 (M. Middendorf and C. Blum), volume 7832 of LNCS, pages 250-261, 2013, Springer.
[pdf] [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 (M. J. Blesa and others), volume 7919 of LNCS, pages 159-173, 2013, Springer.
[pdf] [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 (H.C. Lau and P. Van Hentenryck and G.R. Raidl), pages 28/1-28/10, 2013.
[pdf] [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 (H.C. Lau and P. Van Hentenryck and G.R. Raidl), pages 30/1-30/10, 2013.
[pdf] [details]
Stabilizing Branch-and-Price for Constrained Tree Problems
Markus Leitner, Mario Ruthmair, Günther R. Raidl
Networks, volume 61, number 2, pages 150-170, 2013.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/leitner-11e.pdf
[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, pages 223-225, 2013.
[pdf] [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 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 8111 of LNCS, pages 372-379, 2013, Springer.
[pdf] [details]
A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables
Michael Pimmer, Günther R. Raidl
Chapter in Advances in Metaheuristics (Luca Di~Gaspero and Andrea Schaerf and Thomas Stützle), volume 53 of Operations Research/Computer Science Interfaces Series, pages 143-158, 2013, Springer.
[pdf] [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, pages 167-169, 2013.
[pdf] [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 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 8111 of LNCS, pages 219-226, 2013, Springer.
[pdf] [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 (M. J. Blesa and others), volume 7919 of LNCS, pages 130-143, 2013, Springer.
[pdf] [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 (M. Middendorf and C. Blum), volume 7832 of LNCS, pages 121-132, 2013, Springer.
[pdf] [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
2013, Technical report TR 186-1-13-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [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, pages 765-774, 2013, IAROR.
[pdf] [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 (R. Moreno-Díaz and F. Pichler and A. Quesada-Arencibia), volume 6927 of LNCS, pages 256-263, 2012, Springer.
[pdf] [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), pages 393-400, 2012, ACM Press.
[pdf] [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 (R. Moreno-Díaz and F. Pichler and A. Quesada-Arencibia), volume 6927 of LNCS, pages 287-294, 2012, Springer.
[pdf] [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 (R. Moreno-Díaz and F. Pichler and A. Quesada-Arencibia), volume 6927 of LNCS, pages 248-255, 2012, Springer.
[pdf] [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 (C. Di~Chio and others), volume 7248 of LNCS, pages 376-385, 2012, Springer, Heidelberg.
[pdf] [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 (R. Moreno-Díaz and others), volume 6927 of LNCS, pages 295-302, 2012, Springer.
[pdf] [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, volume 194, number 1, pages 325-339, 2012.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/nothegger-12.pdf
[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 (R. Moreno-Díaz and others), volume 6927 of LNCS, pages 392-399, 2012, Springer.
[pdf] [details]
Hybrid Heuristics for Multimodal Homecare Scheduling
Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann and 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) (Nicolas Beldiceanu and Narendra Jussien and Éric Pinson), pages 339-355, 2012, Springer.
[pdf] [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 (R. Moreno-Díaz and others), volume 6927 of LNCS, pages 351-358, 2012, Springer.
[pdf] [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 (Mahjoub, A.R. and others), volume 7422 of LNCS, pages 225-236, 2012, Springer.
[pdf] [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 (C. A. Coello Coello and others), volume 7492 of LNCS, pages 458-467, 2012, Springer.
[pdf] [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 (J.-K. Hao and M. Middendorf), volume 7245 of LNCS, pages 13-24, 2012, Springer, Heidelberg.
[pdf] [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 (Alexis Quesada-Arencibia and others), pages 247-249, 2011.
[pdf] [details]
Hybrid Metaheuristics in Combinatorial Optimization: A Survey
Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli
Applied Soft Computing, volume 11, pages 4135-4151, 2011.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/blum-11.pdf
[details]
Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques
Andreas Chwatal, Günther R. Raidl
Advances in Operations Research, volume 2011, number 143732, pages 1-38, 2011.
[pdf] [doi] [details]
A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application
Andreas M. Chwatal, Corina Thöni, Karin Oberlechner and Günther R. Raidl
Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS) (M. Ganzha and others), pages 239-246, 2011, IEEE Digital Library.
[pdf] [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 (Alexis Quesada-Arencibia and others), pages 256-259, 2011.
[pdf] [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 (Alexis Quesada-Arencibia and others), pages 244-246, 2011.
[pdf] [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 (J. Pahl and T. Reiners and S. Voß), volume 6701 of LNCS, pages 105-117, 2011, Springer.
[pdf] [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 (A. Quesada-Arencibia and others), pages 261-263, 2011.
[pdf] [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, pages 250-253, May 2011.
[pdf] [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 (J. Pahl and T. Reiners and S. Voß), volume 6701 of LNCS, pages 124-138, June 2011, Springer.
[pdf] [details]
Branch-and-Cut-and-Price for Capacitated Connected Facility Location
Markus Leitner, Günther R. Raidl
Journal of Mathematical Modelling and Algorithms, volume 10, number 3, pages 245-267, 2011, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/leitner-10b.pdf
[doi] [details]
On Stabilized Branch-and-Price for Constrained Tree Problems
Markus Leitner, Mario Ruthmair, Günther R. Raidl
2011, Technical report TR 186-1-11-01, Vienna University of Technology.
[pdf] [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 (Luca Di~Gaspero and Andrea Schaerf and Thomas Stützle), pages 349-358, 2011.
[pdf] [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 (Alexis Quesada-Arencibia and others), pages 302-304, 2011.
[pdf] [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 (Luca Di~Gaspero and Andrea Schaerf and Thomas Stützle), pages 679-681, 2011.
[pdf] [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 (Alexis Quesada-Arencibia and others), pages 285-287, 2011.
[pdf] [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) (O. Günlük and G.J. Woeginger), volume 6655 of LNCS, pages 376-388, 2011, Springer, Heidelberg.
[pdf] [details]
2010
A Brief Survey on Hybrid Metaheuristics
Christian Blum, Jakob Puchinger, Günther R. Raidl and Andrea Roli
Proceedings of BIOMA 2010 – 4th International Conference on Bioinspired Optimization Methods and their Applications (B. Filipic and J. Silc), pages 3-16, 2010.
[pdf] [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 (Jürgen Branke and Martin Pelikan), pages 377-384, 2010, ACM Press.
[pdf] [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 (H. Arabnia and A. M. G. Solo), 2010, CSREA Press.
[pdf] [details]
The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
Bin Hu, Markus Leitner, Günther R. Raidl
Networks, volume 55, number 3, pages 256-275, 2010.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/hu-07.pdf
[details]
Strong Lower Bounds for a Survivable Network Design Problem
Markus Leitner, Günther R. Raidl
ISCO 2010 – International Symposium on Combinatorial Optimization (M. Haouari and A. R. Mahjoub), volume 36 of Electronic Notes in Discrete Mathematics, pages 295-302, 2010, Elsevier.
[pdf] [details]
Branch-and-Cut-and-Price for Capacitated Connected Facility Location
Markus Leitner, Günther R. Raidl
2010, Technical report TR 186-1-10-01, Vienna University of Technology.
[pdf] [details]
Similarity Searching in Sequences of Complex Events
Hannes Obweger, Martin Suntinger, Josef Schiefer and Günther R. Raidl
Proceedings of the Fourth International Conference on Research Challenges in Information Science – RCIS 2010, pages 631-639, 2010, IEEE CPS.
[pdf] [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 (F. Xhafa and others), pages 356-361, 2010, Conference Publishing Services.
[pdf] [details]
Multilevel Variable Neighborhood Search for Periodic Routing Problems
Sandro Pirkwieser, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010 (Peter Cowling and Peter Merz), volume 6022 of LNCS, pages 226-238, 2010, Springer.
[pdf] [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, pages 83-95, 2010.
[pdf] [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 (M. J. Blesa and others), volume 6373 of LNCS, pages 174-189, 2010, Springer.
[pdf] [details]
The Multidimensional Knapsack Problem: Structure and Algorithms
Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
INFORMS Journal on Computing, volume 22, number 2, pages 250-265, 2010.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-07.pdf
[details]
Metaheuristic Hybrids
Günther R. Raidl, Jakob Puchinger, Christian Blum
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), volume 146 of International Series in Operations Research & Management Science, pages 469-496, 2010, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-08a.pdf
[details]
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Günther R. Raidl, Bin Hu
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010 (Peter Cowling and Peter Merz), volume 6022 of LNCS, pages 239-251, 2010, Springer.
Note: best paper award winner
[pdf] [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 (R. Schaefer and others), volume 6239 of LNCS, pages 391-400, 2010, Springer.
[pdf] [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 (M. J. Blesa and others), volume 6373 of LNCS, pages 103-117, 2010, Springer.
[pdf] [details]
Trend-Based Similarity Search in Time-Series Data
Martin Suntinger, Hannes Obweger, Josef Schiefer and Philip Limbeck, Günther R. Raidl
Proceedings of the Second International Conference on Advances in Database, Knowledge, and Data Applications – DBKDA 2010, pages 97-106, 2010, IEEE CPS.
[pdf] [details]
2009
Hybrid Metaheuristics
Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli
Chapter in CPAIOR 10th Anniversary (M. Milano and P. Van Hentenryck), 2009, Springer.
Note: to appear
[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) (A. Quesada-Arencibia and others), pages 222-225, 2009.
[pdf] [details]
Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms
Andreas M. Chwatal, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz and others), volume 5717 of LNCS, pages 649-656, 2009, Springer.
[pdf] [details]
Fitting Multi-Planet Transit Models to CoRoT Time-Data Series by Evolutionary Algorithms
Andreas M. Chwatal, Günther Wuchterl and G\n̈ther R. Raidl
02 2009, Poster presentation, First CoRoT International Symposium.
[pdf] [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 (Maria Grazia Scutellà and others), April 2009.
[pdf] [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, volume 8, number 3, pages 293-334, 2009.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/chwatal-08a.pdf
[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
Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo and T. Stützle and S. Voss), volume 10 of Annals of Information Systems, pages 209-230, 2009, Springer.
[pdf] [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) (A. Quesada-Arencibia and others), pages 228-231, 2009.
[pdf] [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 (R.~Moreno-Díaz and others), volume 5717 of LNCS, pages 665-672, 2009, Springer.
[pdf] [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 (Günther R. Raidl and others), pages 263-270, 2009, ACM Press.
[pdf] [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, pages 63-68, 2009.
Note: best paper award winner
[pdf] [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 (M. G. Scutellá and others), April 2009.
[pdf] [details]
A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location
Markus Leitner, Günther R. Raidl
Proceedings of the 8th Metaheuristics International Conference (Stefan Voss and Marco Caserta), 2009.
[pdf] [details]
Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location
Markus Leitner, Günther R. Raidl
2009, Technical report TR 186-1-09-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [details]
Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Location
Markus Leitner, Günther R. Raidl
Chapter in Post-Conference Book of the Eight Metaheuristics International Conference – MIC 2009, 2009.
Note: to appear
[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 (Maria Grazia Scutellà and others), 2009.
[pdf] [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 (Stefan Voss and Marco Caserta), 2009.
[pdf] [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 (M. J. Blesa and others), volume 5818 of LNCS, pages 175-189, 2009, Springer.
[pdf] [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 (Carlos Cotta and Peter Cowling), volume 5482 of LNCS, pages 25-36, 2009, Springer.
[pdf] [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 (Günther R. Raidl and others), pages 349-356, 2009, ACM Press.
[pdf] [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 (Stefan Voss and others), pages 279-298, 2009, Physica Verlag.
[pdf] [details]
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics
Jakob Puchinger, Günther R. Raidl, Sandro Pirkwieser
Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo and T. Stützle and S. Voss), volume 10 of Annals of Information Systems, pages 71-102, 2009, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-09.pdf
[details]
Cooperative Hybrids for Combinatorial Optimization
Günther R. Raidl
Nature Inspired Cooperative Strategies for Optimization (NICSO 2008) (Natalio Krasnogor and others), volume 236 of Studies in Computational Intelligence, pages X, 2009, Springer.
Note: abstract
[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) (A. Quesada-Arencibia and others), pages 244-246, 2009.
[pdf] [details]
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Mario Ruthmair, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz and others), volume 5717 of LNCS, pages 713-720, 2009, Springer.
[pdf] [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 (M. J. Blesa and others), volume 5818 of LNCS, pages 84-99, 2009, Springer.
[pdf] [details]
2008
Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates
Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner
September 2008, Technical report TR 186-1-08-01, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
[pdf] [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, pages 261-264, 2008, IEEE Computer Society.
[pdf] [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 (P. Hansen and others), 2008.
[pdf] [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
2008, Technical report TR 186-1-08-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [details]
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem
Bin Hu, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2008 (Jano van Hemert and Carlos Cotta), volume 4972 of LNCS, pages 36-47, 2008, Springer.
Note: best paper award winner
[pdf] [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 (Fatos Xhafa and others), pages 73-77, 2008.
[pdf] [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, volume 14, number 5, pages 473-499, 2008.
[pdf] [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, pages 233-236, 2008, IEEE Computer Society.
[pdf] [doi] [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 (M. J. Blesa and others), volume 5296 of LNCS, pages 158-174, 2008, Springer.
[pdf] [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 (Edmund Burke and others), 2008.
[pdf] [details]
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger
Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta and J. van~Hemert), volume 153 of Studies in Computational Intelligence, pages 69-85, 2008, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf
[pdf] [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 (Maarten Keijzer and others), pages 323-330, 2008, ACM.
[pdf] [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 (J. Küng and K. Schneider and R. Wagner), volume 26 of Schriftenreihe Informatik, pages 115-124, 2008, Trauner Verlag.
[pdf] [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 (Caroline Prodhon and others), 2008.
[pdf] [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, volume 191, number 3, pages 1004-1022, 2008.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/prandtstetter-05a.pdf
[pdf] [details]
Combining Forces to Reconstruct Strip Shredded Text Documents
Matthias Prandtstetter, Günther R. Raidl
Hybrid Metaheuristics 2008 (M. J. Blesa and others), volume 5296 of LNCS, pages 175-189, 2008, Springer.
[pdf] [details]
Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search
Jakob Puchinger, Günther R. Raidl
Journal of Heuristics, volume 14, number 5, pages 457-472, 2008.
[pdf] [details]
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
Günther R. Raidl, Jakob Puchinger
Chapter in Hybrid Metaheuristics – An Emergent Approach for Combinatorial Optimization (C. Blum and M. J. Blesa Augilera and A. Roli and M. Sampels), volume 114 of Studies in Computational Intelligence, pages 31-62, 2008, Springer.
[pdf] [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 (T. E. Simos and others), volume 1048 of AIP Conference Proceedings, pages 446-449, 2008, American Institute of Physics.
[pdf] [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, pages 105/1-3, 2007.
[pdf] [details]
Determining Orbital Elements of Extrasolar Planets by Evolution Strategies
Andreas M. Chwatal, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2007 (R. Moreno-Díaz and others), volume 4739 of LNCS, pages 870-877, 2007, Springer.
[pdf] [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, volume 51, number 3, pages 526-536, 2007.
[details]
The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
Bin Hu, Markus Leitner, Günther R. Raidl
2007, Technical report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [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 (Bernard Fortz), pages 69/1-6, 2007.
[pdf] [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 (Carlos Cotta and Jano van~Hemert), volume 4446 of LNCS, pages 176-187, 2007, Springer.
[pdf] [details]
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger
2007, Technical report TR 186-1-07-03, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [details]
The Multidimensional Knapsack Problem: Structure and Algorithms
Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
2007, Technical report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [details]
Models and Algorithms for Three-Stage Two-Dimensional Bin Packing
Jakob Puchinger, Günther R. Raidl
European Journal of Operational Research, volume 183, number 3, pages 1304-1327, 2007.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-04b.pdf
[details]
Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem
Günther R. Raidl, Andreas Chwatal
Numerical Analysis and Applied Mathematics (T. E. Simos), volume 936 of AIP Conference Proceedings, pages 444-447, 2007, American Institute of Physics.
[pdf] [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 (Karl-Heinz Waldmann and Ulrike M. Stocker), 2007, Springer.
[pdf] [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 (Bernard Fortz), pages 103/1-6, 2007.
[pdf] [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 (Maarten Keijzer and others), pages 1187-1194, 2006, ACM.
[pdf] [details]
Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem
Bin Hu, Markus Leitner, Günther R. Raidl
2006, Technical report TR 186-1-06-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [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 (Carlos Cotta and Antonio J. Fernandez and Jose E. Gallardo), 2006.
[pdf] [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, volume 6, number 19, pages 5117-5131, 2006, Wiley.
[pdf] [details]
Evolutionary Approach to Constrained Minimum Spanning Tree Problem
Anna Pagacz, Günther R. Raidl, Stanislaw Zawiślak
Evolutionary Computation and Global Optimization 2006 (Jaroslawa Arabasa), pages 331-341, 2006.
[pdf] [details]
The Core Concept for the Multidimensional Knapsack Problem
Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2006 (Jens Gottlieb and Günther R. Raidl), volume 3906 of LNCS, pages 195-208, 2006, Springer.
[pdf] [details]
Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search
Jakob Puchinger, Günther R. Raidl
2006, Technical report TR 186-1-06-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [details]
Biased Mutation Operators for Subgraph-Selection Problems
Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom
IEEE Transactions on Evolutionary Computation, volume 10, number 2, pages 145-156, 2006, IEEE Press.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-05.pdf
[details]
A Unified View on Hybrid Metaheuristics
Günther R. Raidl
Proceedings of the Hybrid Metaheuristics Workshop (Francisco Almeida and others), volume 4030 of LNCS, pages 1-12, 2006, Springer.
[pdf] [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 (L Gouveia and C. Mourão), pages 178-185, 2005.
[pdf] [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 (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
[pdf] [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 (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
[pdf] [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 (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
[pdf] [details]
An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem
Matthias Prandtstetter, Günther R. Raidl
2005, Technical report TR 186-1-05-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [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, volume 3562 of LNCS, pages 41-53, 2005, Springer.
[pdf] [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, pages 775-780, 2005.
[pdf] [details]
Relaxation Guided Variable Neighborhood Search
Jakob Puchinger, Günther R. Raidl
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
[pdf] [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, volume 13, number 4, pages 441-475, 2005.
[pdf] [details]
Evolutionary Computation: An Overview and Recent Trends
Günther R. Raidl
̈OGAI Journal, volume 24, pages 2-7, 2005, Österreichische Gesellschaft für Artificial Intelligence.
[pdf] [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 and U.~Pferschy, G.~Raidl, R.Weiskircher Deb and others), volume 3102 of LNCS, pages 1304-1315, 2004, Springer.
Genetic and Evolutionary Computation – GECCO 2004 (K.
[pdf] [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 (Xin Yao and others), volume 3242 of LNCS, pages 302-311, 2004, Springer-Verlag.
[pdf] [details]
Solving a Real-World Glass Cutting Problem
Jakob Puchinger, Günther R. Raidl, Gabriele Koller
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2004 (Jens Gottlieb and Günther R. Raidl), volume 3004 of LNCS, pages 162-173, 2004, Springer.
[pdf] [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 (X. Yao et. al), volume 3242 of LNCS, pages 642-651, 2004, Springer.
[pdf] [details]
Models and Algorithms for Three-Stage Two-Dimensional Bin Packing
Jakob Puchinger, Günther R. Raidl
2004, Technical report TR 186-1-04-04, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [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 (H. M. Haddadd and others), pages 990-995, 2004, ACM Press.
[pdf] [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
2004, Technical report TR 186-1-04-05, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [details]
Biased Mutation Operators for Subgraph-Selection Problems
Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom
2004, Technical report TR 186-1-04-06, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[pdf] [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 (A. Barry and F. Rothlauf and D. Thierens and others), pages 2-7, 2003.
Note: best paper award winner of the workshop
[pdf] [details]
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs
I. Ljubić, G. R. Raidl
Journal of Heuristics, volume 9, pages 401-427, 2003, Kluwer Academic Publishers.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/ljubic-02.pdf
[details]
Edge-Sets: An Effective Evolutionary Coding of Spanning Trees
G. R. Raidl, B. A. Julstrom
IEEE Transactions on Evolutionary Computation, volume 7, number 3, pages 225-239, 2003.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-01.pdf
[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 (G. Lamont and others), pages 747-752, 2003, ACM Press.
[pdf] [details]
Hybrid Evolutionary Algorithms for Combinatorial Optimization
G. R. Raidl
March 2003, Habilitation thesis at the Vienna University of Technology.
[pdf] [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 (G. Lamont and others), pages 547-552, 2002, ACM Press.
[pdf] [details]
A Memetic Algorithm for Vertex-Biconnectivity Augmentation
S. Kersting, G. R. Raidl, I. Ljubić
Applications of Evolutionary Computing: EvoWorkshops 2002 (S. Cagnoni and others), volume 2279 of LNCS, pages 102-111, 2002, Springer.
[pdf] [details]
Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem
G. R. Raidl, I. Ljubić
Information Processing Letters, volume 82, number 1, pages 39-45, 2002.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-02.pdf
[details]
On Weight-Biased Mutation for Graph Problems
Günther R. Raidl, Gabriele Kodydek, Bryant Julstrom
Parallel Problem Solving from Nature – PPSN VII (J. J. Merelo Guervos and P. Adamidis and H.-G. Beyer and J.-L. Fernández-Villacañas and H.-P. Schwefel), volume 2439 of LNCS, pages 204-213, 2002.
[pdf] [details]
Letting Ants Labeling Point Features
M. Schreyer, G. R. Raidl
Proceedings of the 2002 IEEE Congress on Evolutionary Computation (D. Fogel and others), pages 1564-1569, 2002, IEEE Press.
[pdf] [details]
2001
Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search
J. Gottlieb, B. A. Julstrom, F. Rothlauf and G. R. Raidl
Proceedings of the 2001 Genetic and Evolutionary Computation Conference (L. Spector and others), pages 343-350, 2001, Morgan Kaufmann.
[pdf] [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 (G. Lamont and others), pages 321-326, 2001, ACM Press.
[pdf] [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 (E. J.-W. Boers and others), volume 2037 of LNCS, pages 20-29, 2001, Springer.
[pdf] [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 (D. Whitley and others), pages 283-290, 2000, Morgan Kaufmann.
[pdf] [details]
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
I. Ljubić, G. R. Raidl, J. Kratica
Parallel Problem Solving from Nature – PPSN VI (K. Deb and others), volume 1917 of LNCS, pages 641-650, 2000, Springer.
[pdf] [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 (J. Carroll and others), pages 440-445, 2000, ACM Press.
[pdf] [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, pages 309-316, 2000.
[pdf] [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 (C. Fonseca and others), pages 104-111, 2000, IEEE Press.
[pdf] [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 (Cyril Fonlupt and others), volume 1829 of LNCS, pages 38-52, 1999, Springer.
[pdf] [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 (Janice Carroll and others), pages 291-296, 1999, ACM Press.
[pdf] [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 (Peter J. Angeline and others), pages 596-603, 1999, IEEE Press.
[pdf] [details]
An Evolutionary Approach to Point-Feature Label Placement
Günther R. Raidl
Proceedings of the 1999 Genetic and Evolutionary Computation Conference (Wolfgang Banzhaf and others), pages 807, 1999, Morgan Kaufmann.
Note: short paper
[pdf] [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 (Scott Brave and Annie S. Wu), pages 204-211, 1999.
[pdf] [details]
The Multiple Container Packing Problem: A Genetic Algorithm Approach with Weighted Codings
Günther R. Raidl
ACM SIGAPP Applied Computing Review, volume 7, number 2, pages 22-31, 1999, ACM Press.
[pdf] [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, pages 885-890, 1998.
[pdf] [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 (Agoston E. Eiben and others), volume 1498 of LNCS, pages 875-884, 1998, Springer.
[pdf] [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 (D. Fogel and others), pages 207-211, 1998, IEEE Press.
[pdf] [details]
A Hybrid GP Approach for Numerically Robust Symbolic Regression
Günther R. Raidl
Proceedings of the 3rd Annual Genetic Programming Conference (J. Koza and others), pages 323-328, 1998, Morgan Kaufmann.
[pdf] [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 (J. Sarnovsky and others), pages 247-256, 1998.
[pdf] [details]
A Genetic Algorithm for Labeling Point Features
Günther R. Raidl
Proceedings of the International Conference on Imaging Science, Systems and Technology (H.~R.~Arabnia and P.-C.~Chung and J.~B.~Farison and G.~R.~Raidl and M. Sarfraz and Z. Zhang), pages 189-196, 1998, CSREA Press.
[pdf] [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 (G. B. Beretta and R. Eschbach), pages 98-106, 1998.
[pdf] [details]
1994
Progressives, adaptives Ray-Tracing von Bildern mit hoher zeitlicher Kohärenz
Günther Raidl
1994, PhD thesis, Vienna University of Technology.
[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), pages 1-8, ACM Press.
[doi] [details]
AC Admin
Website maintainer