2024W

• Algorithmics / 186.814 / VU
• Bachelor Thesis in Computer Science / 186.819 / PR
• Heuristic Optimization Techniques / 192.137 / VU
• Project in Computer Science 1 / 192.021 / PR
• Propädeutikum für Informatik / 180.771 / VU
• Researchseminar for PhD candidates / 186.842 / SE
• Scientific Research and Writing / 193.052 / SE
• Seminar for Master Students in Logic and Computation / 180.773 / SE
• Seminar for PhD candidates / 186.199 / SE

2025S

• Algorithms and Data Structures / 186.866 / VU
• Bachelor Thesis in Computer Science / 186.819 / PR
• Mathematical Programming / 186.835 / VU
• Optimization in Transport and Logistics / 186.190 / VU
• Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
• Project in Computer Science 1 / 192.021 / PR
• Researchseminar for PhD candidates / 186.842 / SE
• Scientific Research and Writing / 193.052 / SE
• Seminar for PhD candidates / 186.199 / SE
• Seminar on Algorithms / 186.182 / SE

 

• Study on Metaheuristic and Reinforcement Learning-Based Methods for a Dynamic Electric Dial-a-Ride Problem
  2024 – 2025 / Honda Research Institute Europe Gmb
• Learning to Solve Dynamic Vehicle Routing Problems
  2023 – 2027 / Honda Research Institute Europe Gmb
  Publications: 208029 / 208028 / 209532 / 211681
• Cooperative Personnel Scheduling
  2022 – 2026 / Honda Research Institute Europe Gmb
  Publications: 208725 / 208724 / 209992 / 209613
• Cooperative Optimization (Extension)
  2021 – 2022 / Honda Research Institute Europe Gmb
• Study on computational methods for cooperative personnel scheduling
  2021 / Honda Research Institute Europe Gmb
• Study on advanced computational methods for planning battery exchange stations for electric scooters
  2021 / Honda Motor Co., Ltd.
• Erweiterung des Software-Systems zum automatisierten Dispatching bei Alfie's
  2021 / Alfie's GmbH
• Studie über Algorithmen zum Scheduling des Ladens von Elektrofahrzeugen unter besonderer Berücksichtigung von variablen maximalen Ladestromstärken
  2020 – 2021 / Honda Research Institute Europe Gmb
• Study on computational methods for fleet scheduling in E-mobility
  2020 – 2021 / Honda Research Institute Europe Gmb
• Studie über Algorithmen zur Standortoptimierung von Batterie-Tauschstationen für E-Scooter
  2019 – 2020 / Honda Research Institute Europe Gmb
• Auftragsvorhersage und Schichtplanung für Alfie's
  2019 – 2020 / Alfie's GmbH
• Alfies: Preliminary study on automated dispatching
  2019 / Alfie's GmbH
• Developing algorithms to solve scheduling problems in radio therapy
  2015 – 2017 / EBG MedAustron GmbH
• Planing bike sharing systems considering the demand, distribution and maintenance works
  2015 – 2017 / Austrian Research Promotion Agency (FFG)
• Route Planning for Security Controls
  2015 – 2016 / Austrian Research Promotion Agency (FFG)
• Development of a cutting stock optimization software
  2014 – 2016 / LodeStar Technology
• Solution Archives in Evolutionary Combinatorial Optimization
  2012 – 2016 / Austrian Science Fund (FWF)
  Publications: 148209 / 150483 / 56176
• Multi-Criteria Optimization of FTTx Networks
  2012 – 2013 / Austrian Science Fund (FWF)
• Balancing Bike-Sharing Systems
  2011 – 2016 / Austrian Research Promotion Agency (FFG)
  Publications: 55209 / 55210
• Optimization Challenges in the Operation of the Future, Federated Internet
  2010 – 2014 / Vienna Science and Technology Fund (WWTF)
• Matheuristics: Hybrid Algorithms for Transportation Problems
  2008 – 2010 / Austrian Science Fund (FWF)
• Optimization of storage strategies in paper industry
  2007 – 2008 / Dataphone GmbH
• Optimization of commission tours in a warehouse
  2007 – 2008 / Dataphone GmbH
• Algorithmic Discrete Optimization
  2004 – 2008 / European Commission
• Combining Memetic Algorithms and Branch & Cut & Price for Some Network Design Problems
  2003 – 2006 / Austrian Science Fund (FWF)

2025

• A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem / Reixach, J., Blum, C., Djukanovic, M., & Raidl, G. R. (2025). A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem. IEEE Transactions on Evolutionary Computation, Early Access. https://doi.org/10.1109/TEVC.2024.3413150

2024

• A Simulated Annealing Based Approach for the Roman Domination Problem / Greilhuber, J., Schober, S., Iurlano, E., & Raidl, G. R. (2024). A Simulated Annealing Based Approach for the Roman Domination Problem. In B. Dorronsoro, R. Ellaia, & E.-G. Talbi (Eds.), Metaheuristics and Nature Inspired Computing (pp. 28–43). Springer. https://doi.org/10.1007/978-3-031-69257-4_3
• Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem / Bresich, M., Varga, J., Raidl, G. R., & Limmer, S. (2024). Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem. In B. Dorronsoro, R. Ellaia, & E.-G. Talbi (Eds.), Metaheuristics and Nature Inspired Computing : 9th International Conference, META 2023, Marrakech, Morocco, November 1–4, 2023, Revised Selected Papers (pp. 3–20). Springer. https://doi.org/10.1007/978-3-031-69257-4_1
  Project: Learning to Solve Dynamic Vehicle Routing Problems (2023–2027)
• Learning to Solve Dynamic Vehicle Routing Problems / Bresich, M., Raidl, G., Limmer, S., & Probst, M. (2024, September). Learning to Solve Dynamic Vehicle Routing Problems [Poster Presentation]. HRI European Graduate Network (EGN) Symposium, Offenbach, Germany.
  Project: Learning to Solve Dynamic Vehicle Routing Problems (2023–2027)
• Scheduling jobs using queries to interactively learn human availability times / Varga, J., Raidl, G. R., Rönnberg, E., & Rodemann, T. (2024). Scheduling jobs using queries to interactively learn human availability times. COMPUTERS & OPERATIONS RESEARCH, 167, Article 106648. https://doi.org/10.1016/j.cor.2024.106648
  Download: Scheduling jobs using queries to interactively learn human availability times (1.05 MB)
  Project: Cooperative Personnel Scheduling (2022–2026)
• Signed double Roman domination on cubic graphs / Iurlano, E., Zec, T., Djukanovic, M., & Raidl, G. R. (2024). Signed double Roman domination on cubic graphs. Applied Mathematics and Computation, 471, Article 128612. https://doi.org/10.1016/j.amc.2024.128612
  Download: Signed double Roman domination on cubic graphs (912 KB)
• Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Network / Raidl, G. (2024, February 1). Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Network [Presentation]. Invited talk at the School of Mathematics, Edinburgh, United Kingdom of Great Britain and Northern Ireland (the).
• Exact methods for the Selective Assessment Routing Problem / Salvà Soler, J., Hemmelmayr, V., & Raidl, G. R. (2024). Exact methods for the Selective Assessment Routing Problem. Central European Journal of Operations Research. https://doi.org/10.1007/s10100-024-00943-y
• Speeding Up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks / Varga, J., Karlsson, E., Raidl, G. R., Rönnberg, E., Lindsten, F., & Rodemann, T. (2024). Speeding Up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks. In G. Nicosia, V. Ojha, & E. La Malfa (Eds.), Machine Learning, Optimization, and Data Science : 9th International Conference, LOD 2023, Grasmere, UK, September 22–26, 2023, Revised Selected Papers, Part I (pp. 24–38). Springer. https://doi.org/10.1007/978-3-031-53969-5_3
  Project: Cooperative Personnel Scheduling (2022–2026)
• Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion / Bresich, M., Raidl, G. R., & Limmer, S. (2024). Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion. In GECCO ’24 Companion: Proceedings of the Genetic and Evolutionary Computation Conference Companion (pp. 142–150). Association for Computing Machinery. https://doi.org/10.1145/3638529.3654057
  Project: Learning to Solve Dynamic Vehicle Routing Problems (2023–2027)
• A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem / Reixach, J., Blum, C., Djukanović, M., & Raidl, G. R. (2024). A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem. In Evolutionary Computation in Combinatorial Optimization : 24th European Conference, EvoCOP 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, April 3–5, 2024, Proceedings (pp. 1–15). https://doi.org/10.1007/978-3-031-57712-3_1

2023

• Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines / Frohner, N., Raidl, G., & Chicano, F. (2023). Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines. In GECCO ’23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation (pp. 1941–1949). Association for Computing Machinery. https://doi.org/10.1145/3583133.3596381
• Large neighborhood search for electric vehicle fleet scheduling / Limmer, S., Varga, J., & Raidl, G. (2023). Large neighborhood search for electric vehicle fleet scheduling. Energies, 16(12), Article 4576. https://doi.org/10.3390/en16124576
  Download: PDF (328 KB)
• A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning / Jatschka, T., Rodemann, T., & Raidl, G. R. (2023). A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning. In L. Pérez Cáceres & T. Stützle (Eds.), Evolutionary Computation in Combinatorial Optimization: 23rd European Conference, EvoCOP 2023, Held as Part of EvoStar 2023, Brno, Czech Republic, April 12–14, 2023. Proceedings (pp. 50–65). Springer. https://doi.org/10.34726/5294
  Download: PDF (497 KB)
• Parallel Beam Search for Combinatorial Optimization / Frohner, N., Gmys, J., Melab, N., Raidl, G., & Talbi, E.-G. (2023). Parallel Beam Search for Combinatorial Optimization. In The 51st International Conference on Parallel Processing. Workshop Proceedings. 51st International Conference on Parallel Processing (ICPP ’22), Bordeaux, France. Association for Computing Machinery. https://doi.org/10.1145/3547276.3548633
  Download: PDF (649 KB)
• Interactive Job Scheduling with Partially Known Personnel Availabilities / Varga, J., Raidl, G. R., Rönnberg, E., & Rodemann, T. (2023). Interactive Job Scheduling with Partially Known Personnel Availabilities. In B. Dorronsoro, F. Chicano, G. Danoy, & E.-G. Talbi (Eds.), Optimization and Learning: 6th International Conference, OLA 2023, Malaga, Spain, May 3–5, 2023, Proceedings (pp. 236–247). Springer. https://doi.org/10.1007/978-3-031-34020-8_18
• Optimizing the positions of battery swapping stations - Pilot studies and layout optimization algorithm - / Rodemann, T., Kataoka, H., Jatschka, T., Raidl, G., Limmer, S., & Meguro, H. (2023). Optimizing the positions of battery swapping stations - Pilot studies and layout optimization algorithm -. In EVTeC 2023: The 6th International Electric Vehicle Technology Conference (pp. 28–28). http://hdl.handle.net/20.500.12708/193383
• An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles / Limmer, S., Varga, J., & Raidl, G. R. (2023). An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles. In J. G. M. Correia, S. Smith, & R. Qaddoura (Eds.), Applications of Evolutionary Computation : 26th European Conference, EvoApplications 2023, Held as Part of EvoStar 2023, Brno, Czech Republic, April 12–14, 2023, Proceedings (pp. 3–18). Springer. https://doi.org/10.1007/978-3-031-30229-9_1
• Approaching the Traveling Tournament Problem with Randomized Beam Search / Frohner, N., Neumann, B., Pace, G., & Raidl, G. R. (2023). Approaching the Traveling Tournament Problem with Randomized Beam Search. Evolutionary Computation, 31(3), 233–257. https://doi.org/10.1162/evco_a_00319

2022

• Learning for Guiding Metaheuristics / Raidl, G. (2022, November 3). Learning for Guiding Metaheuristics [Conference Presentation]. ELLIIT Focus Perios Seminar Series, Sweden.
• Learning Beam Search: Utilizing Machine Learning for Solving Combinatorial Optimization Problems / Raidl, G. (2022, November 1). Learning Beam Search: Utilizing Machine Learning for Solving Combinatorial  Optimization Problems [Conference Presentation]. ELLIIIT Focus Period Workshop: Hybrid AI, Sweden.
• Learning for Guiding Metaheuristics / Raidl, G. (2022, July 19). Learning for Guiding Metaheuristics [Keynote Presentation]. OLA’2022: Int. Conference on Optimization and Learning, Italy.
• Parallel Beam Search for Combinatorial Optimization (Extended Abstract) / Frohner, N., Gmys, J., MELAB, N., Raidl, G., & Talbi, E. (2022). Parallel Beam Search for Combinatorial Optimization (Extended Abstract). In Fifteenth International Symposium on Combinatorial Search (pp. 273–275). https://doi.org/10.1609/socs.v15i1.21783
• A Learning Large Neighborhood Search for the Staff Rerostering Problem / Oberweger, F. F., Raidl, G., Rönnberg, E., & Huber, M. (2022). A Learning Large Neighborhood Search for the Staff Rerostering Problem. In P. Schaus (Ed.), Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 300–317). Springer International Publishing. https://doi.org/10.1007/978-3-031-08011-1_20
• A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications / Jatschka, T., Rodemann, T., & Raidl, G. (2022). A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications. In B. Dorronsora, F. Yalaoui, E.-G. Talbi, & G. Danoy (Eds.), Metaheuristics and Nature Inspired Computing (pp. 3–17). Springer International Publishing. https://doi.org/10.1007/978-3-030-94216-8_1
• Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems / Huber, M., & Raidl, G. (2022). Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems. In Machine Learning, Optimization, and Data Science (pp. 283–298). Springer Nature Switzerland AG. https://doi.org/10.34726/3443
  Download: PDF (322 KB)
• A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters / Jatschka, T., Rauscher, M., Kreutzer, B., Rodemann, T., & Raidl, G. (2022). A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters. In Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (pp. 32–33). IUCTC Universidad de Las Palmas de Gran Canaria. http://hdl.handle.net/20.500.12708/176897
• A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters / Jatschka, T., Rauscher, M., Kreutzer, B., Okamoto, Y., Kataoka, H., Rodemann, T., & Raidl, G. R. (2022). A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters. In R. Moreno-Díaz, F. Pichler, & A. Quesada-Arencibia (Eds.), Computer Aided Systems Theory – EUROCAST 2022 : 18th International Conference, Las Palmas de Gran Canaria, Spain, February 20–25, 2022, Revised Selected Papers (pp. 121–129). Springer. https://doi.org/10.1007/978-3-031-25312-6_14
• Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences / Djukanović, M., Kartelj, A., Matić, D., Grbić, M., Blum, C., & Raidl, G. R. (2022). Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Applied Soft Computing, 122, Article 108844. https://doi.org/10.1016/j.asoc.2022.108844
• A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation / Mayerhofer, J., Kirchweger, M., Huber, M., & Raidl, G. (2022). A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation. In Evolutionary Computation in Combinatorial Optimization (pp. 127–142). Springer Nature Switzerland AG. https://doi.org/10.34726/3442
  Download: PDF (434 KB)
• Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet / Varga, J., Raidl, G., & Limmer, S. (2022). Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet. IEEE Access, 10, 105786–105806. https://doi.org/10.1109/ACCESS.2022.3210168
  Download: PDF (2.25 MB)
• A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems / Huber, M., & Raidl, G. (2022). A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems. In A. Quesada-Arencibia, J. C. Rodriguez, R. Moreno-Díaz, G. S. de Blasio, & C. R. Garcia (Eds.), Computer Aided Systems Theory - Extended Abstracts (pp. 22–23). IUCTC Universidad de Las Palmas de Gran Canaria.
• A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning / Jatschka, T., Rodemann, T., & Raidl, G. (2022). A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning [Conference Presentation]. HRI EGN Symposium, Germany. http://hdl.handle.net/20.500.12708/153058
• Learning Value Functions for Same-Day Delivery Problems / Frohner, N., & Raidl, G. (2022). Learning Value Functions for Same-Day Delivery Problems. In Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (pp. 20–21). http://hdl.handle.net/20.500.12708/142196
  Download: PDF (510 KB)

2021

• Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers / Schaden, B., Jatschka, T., Limmer, S., & Raidl, G. (2021). Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers. Energies, 14(22), 1–33. https://doi.org/10.3390/en14227755
  Download: PDF (961 KB)
• Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources / Maschler, J., & Raidl, G. (2021). Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources. Annals of Operations Research, 302, 507–531. https://doi.org/10.1007/s10479-019-03479-6
  Download: PDF (499 KB)
• Driver Shift Planning for an Online Store with Short Delivery Times / Horn, M., Frohner, N., & Raidl, G. R. (2021). Driver Shift Planning for an Online Store with Short Delivery Times. In Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020) (pp. 517–524). Elsevier. https://doi.org/10.1016/j.procs.2021.01.270
• A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications / Jatschka, T., Rodemann, T., & Raidl, G. (2021). A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications. Honda Research Institute Europe, Offenbach, Germany, Honda Research Institute Europe, Offenbach, Germany, Germany. http://hdl.handle.net/20.500.12708/87248
• A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications / Jatschka, T., Raidl, G. R., & Rodemann, T. (2021). A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. Algorithms, 14(8), 232. https://doi.org/10.3390/a14080232
• Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings / Nikolic, B., Kartelj, A., Djukanovic, M., Grbic, M., Blum, C., & Raidl, G. (2021). Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings. Mathematics, 9(13), 1515. https://doi.org/10.3390/math9131515
• Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources / Maschler, J., & Raidl, G. R. (2021). Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources. Annals of Operations Research, 302(2), 507–531. https://doi.org/10.1007/s10479-019-03479-6
• A$$^*$$-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem / Horn, M., & Raidl, G. R. (2021). A$$^*$$-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 72–88). LNCS / Springer. https://doi.org/10.1007/978-3-030-78230-6_5
• Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems / Bracher, A., Frohner, N., & Raidl, G. R. (2021). Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 283–298). LNCS / Springer. https://doi.org/10.1007/978-3-030-78230-6_18

2020

• Finding Longest Common Subsequences: New anytime A* search results / Djukanovic, M., Raidl, G. R., & Blum, C. (2020). Finding Longest Common Subsequences: New anytime A* search results. Applied Soft Computing, 95, Article 106499. https://doi.org/10.1016/j.asoc.2020.106499
• Towards Improving Merging Heuristics for Binary Decision Diagrams / Frohner, N., & Raidl, G. (2020). Towards Improving Merging Heuristics for Binary Decision Diagrams. In N. Matsatsinis, Y. (Ioannis) Marinakis, & P. Pardalos (Eds.), Learning and Intelligent Optimization : 13th International Conference, LION 13, Chania, Crete, Greece, May 27–31, 2019, Revised Selected Papers (pp. 30–45). LNCS. https://doi.org/10.1007/978-3-030-38629-0_3
• Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers / Frohner, N., & Raidl, G. (2020). Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers. In G. Nicosia, P. Pardalos, R. Umeton, G. GIUFFRIDA, & V. Sciacca (Eds.), Machine Learning, Optimization, and Data Science (pp. 445–457). LNCS. https://doi.org/10.1007/978-3-030-37599-7_37
• A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem / Kaufmann, T., Horn, M., & Raidl, G. R. (2020). A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem. In Parallel Problem Solving from Nature – PPSN XVI (pp. 385–398). LNCS / Springer. https://doi.org/10.1007/978-3-030-58115-2_27
• VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points / Jatschka, T., Rodemann, T., & Raidl, G. R. (2020). VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points. In Computer Aided Systems Theory – EUROCAST 2019 (pp. 255–262). LNCS. https://doi.org/10.1007/978-3-030-45093-9_31
• A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility / Frohner, N., & Raidl, G. (2020). A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 58–76). http://hdl.handle.net/20.500.12708/58363
• On Solving a Generalized Constrained Longest Common Subsequence Problem / Djukanovic, M., Berger, C., Raidl, G. R., & Blum, C. (2020). On Solving a Generalized Constrained Longest Common Subsequence Problem. In Optimization and Applications (pp. 55–70). LNCS / Springer. https://doi.org/10.1007/978-3-030-62867-3_5
• On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences / Horn, M., Djukanovic, M., Blum, C., & Raidl, G. R. (2020). On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. In Optimization and Applications (pp. 134–149). LNCS / Springer. https://doi.org/10.1007/978-3-030-62867-3_11
• A Beam Search Approach to the Traveling Tournament Problem / Frohner, N., Neumann, B., & Raidl, G. R. (2020). A Beam Search Approach to the Traveling Tournament Problem. In Evolutionary Computation in Combinatorial Optimization (pp. 67–82). LNCS. https://doi.org/10.1007/978-3-030-43680-3_5
• A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation / Djukanovic, M., Raidl, G. R., & Blum, C. (2020). A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. In Machine Learning, Optimization, and Data Science (pp. 154–167). LNCS. https://doi.org/10.1007/978-3-030-37599-7_14
• Distributing Battery Swapping Stations for Electric Scooters in an Urban Area / Jatschka, T., Rodemann, T., & Raidl, G. (2020). Distributing Battery Swapping Stations for Electric Scooters in an Urban Area. In Optimization and Applications (pp. 150–165). LNCS / Springer. https://doi.org/10.1007/978-3-030-62867-3_12
• Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines / Frohner, N., Horn, M., & Raidl, G. R. (2020). Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines. In Procedia Computer Science (pp. 366–370). Elsevier. https://doi.org/10.1016/j.procs.2021.01.175
• An A∗Search Algorithm for the Constrained Longest Common Subsequence Problem / Djukanovic, M., Berger, C., Raidl, G. R., & Blum, C. (2020). An A∗Search Algorithm for the Constrained Longest Common Subsequence Problem. Information Processing Letters, 166(106041), 106041. https://doi.org/10.1016/j.ipl.2020.106041
• A model for finding transition-minors / Klocker, B., Fleischner, H., & Raidl, G. R. (2020). A model for finding transition-minors. Discrete Applied Mathematics, 283, 242–264. https://doi.org/10.1016/j.dam.2020.01.006
• A*-based construction of decision diagrams for a prize-collecting scheduling problem / Horn, M., Maschler, J., Raidl, G. R., & Rönnberg, E. (2020). A*-based construction of decision diagrams for a prize-collecting scheduling problem. Computers and Operations Research, 126(105125), 105125. https://doi.org/10.1016/j.cor.2020.105125
• Anytime algorithms for the longest common palindromic subsequence problem / Djukanovic, M., Raidl, G. R., & Blum, C. (2020). Anytime algorithms for the longest common palindromic subsequence problem. Computers and Operations Research, 114(104827), 104827. https://doi.org/10.1016/j.cor.2019.104827
• Solving longest common subsequence problems via a transformation to the maximum clique problem / Blum, C., Djukanovic, M., Santini, A., Jiang, H., Li, C.-M., Manyà, F., & Raidl, G. R. (2020). Solving longest common subsequence problems via a transformation to the maximum clique problem. Computers and Operations Research, 125(105089), 105089. https://doi.org/10.1016/j.cor.2020.105089
• A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three / Klocker, B., Fleischner, H., & Raidl, G. R. (2020). A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three. Applied Mathematics and Computation, 380(125233), 125233. https://doi.org/10.1016/j.amc.2020.125233
• A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources / Horn, M., Raidl, G. R., & Rönnberg, E. (2020). A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources. Annals of Operations Research, 302(2), 477–505. https://doi.org/10.1007/s10479-020-03550-7
• On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences / Horn, M., Djukanovic, M., Blum, C., & Raidl, G. (2020). On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. CPAIOR 2020, Wien, Austria. http://hdl.handle.net/20.500.12708/87120

2019

• Particle therapy patient scheduling with limited starting time variations of daily treatments / Maschler, J., & Raidl, G. (2019). Particle therapy patient scheduling with limited starting time variations of daily treatments. International Transactions in Operational Research, 27(1), 458–479. https://doi.org/10.1111/itor.12579
  Download: PDF (352 KB)
• Casual Employee Scheduling with Constraint Programming and Metaheuristics / Frohner, N., Teuschl, S., & Raidl, G. R. (2019). Casual Employee Scheduling with Constraint Programming and Metaheuristics. In Computer Aided Systems Theory – EUROCAST 2019 (pp. 279–287). LNCS. https://doi.org/10.1007/978-3-030-45093-9_34
• Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization / Frohner, N., Teuschl, S., & Raidl, G. (2019). Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization. In Eurocast2019-EXTENDED ABSTRACTS (pp. 78–79). Universidad de Las Palmas de Gran Canaria. http://hdl.handle.net/20.500.12708/58361
• Metaheuristic Hybrids / Raidl, G., Puchinger, J., & Blum, C. (2019). Metaheuristic Hybrids. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of Metaheuristics (Vol. 272, pp. 385–417). Springer. https://doi.org/10.1007/978-3-319-91086-4_12
• A SAT Approach for Finding Sup-Transition-Minors / Klocker, B., Fleischner, H., & Raidl, G. R. (2019). A SAT Approach for Finding Sup-Transition-Minors. In Learning and Intelligent Optimization 13th International Conference, LION 13, Chania, Crete, Greece, May 27–31, 2019, Revised Selected Papers (pp. 325–341). LNCS. https://doi.org/10.1007/978-3-030-38629-0_27
• A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem / Blum, C., Thiruvady, D., Ernst, A. T., Horn, M., & Raidl, G. R. (2019). A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem. In AI 2019: Advances in Artificial Intelligence (pp. 549–560). LNCS. https://doi.org/10.1007/978-3-030-35288-2_44
• Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications / Jatschka, T., Rodemann, T., & Raidl, G. (2019). Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. In Machine Learning, Optimization, and Data Science (pp. 738–750). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/58158
• Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem / Horn, M., & Raidl, G. (2019). Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem. In Computer Aided System Theory - EUROCAST 2019 (pp. 94–95). http://hdl.handle.net/20.500.12708/58004
• VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points / Jatschka, T., Rodemann, T., & Raidl, G. (2019). VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points. In EXTENDED ABSTRACTS-Computer Aided Systems Theory 2019 (pp. 70–71). IUCTC Universidad de Las Palmas de Gran Canaria. http://hdl.handle.net/20.500.12708/57826
• A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications / Jatschka, T., Rodemann, T., & Raidl, G. (2019). A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. In Evolutionary Computation in Combinatorial Optimization 2019 (pp. 1–16). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/57824
• A Heuristic Approach for Solving the Longest Common Square Subsequence Problem / Djukanovic, M., Raidl, G., & Blum, C. (2019). A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. In EXTENDED ABSTRACTS-Computer Aided Systems Theory 2019 (pp. 120–122). IUCTC Universidad de Las Palmas de Gran Canaria. http://hdl.handle.net/20.500.12708/57818
• Strategies for Iteratively Refining Layered Graph Models / Riedler, M., Ruthmair, M., & Raidl, G. (2019). Strategies for Iteratively Refining Layered Graph Models. In Hybrid Metaheuristics: 11th International Workshop (pp. 46–62). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/57817
• A Memetic Algorithm for Competitive Facility Location Problems / Biesinger, B., Hu, B., & Raidl, G. R. (2019). A Memetic Algorithm for Competitive Facility Location Problems. In Business and Consumer Analytics: New Ideas (pp. 637–660). Springer. https://doi.org/10.1007/978-3-030-06222-4_15
• Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm / Horn, M., Raidl, G., & Blum, C. (2019). Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm. Artificial Intelligence, 277(103173), 103173. https://doi.org/10.1016/j.artint.2019.103173

2018

• Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments / Maschler, J., & Raidl, G. (2018). Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments. International Transactions in Operational Research, 27(1), 458–479. https://doi.org/10.1111/itor.12579
• Solving a selective dial-a-ride problem with logic-based Benders decomposition / Riedler, M., & Raidl, G. (2018). Solving a selective dial-a-ride problem with logic-based Benders decomposition. Computers and Operations Research, 96, 30–54. https://doi.org/10.1016/j.cor.2018.03.008
• Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem / Maschler, J., & Raidl, G. (2018). Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem. In PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling} (pp. 375–397). http://hdl.handle.net/20.500.12708/57564
• Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments / Maschler, J., Riedler, M., & Raidl, G. R. (2018). Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments. In Computer Aided Systems Theory – EUROCAST 2017 (pp. 364–372). Springer. https://doi.org/10.1007/978-3-319-74718-7_44
• Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging / Klocker, B., & Raidl, G. (2018). Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging. In Computer Aided Systems Theory -- EUROCAST 201 (pp. 355–363). Springer LNCS. http://hdl.handle.net/20.500.12708/57551
• An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows / Horn, M., Raidl, G., & Rönnberg, E. (2018). An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows. In Annals of Operations Research (pp. 235–256). Springer. http://hdl.handle.net/20.500.12708/57525
• GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection / Expósito, A., Raidl, G., Brito, J., & Moreno-Perez, J. (2018). GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection. In Computer Aided Systems Theory (pp. 299–306). Springer LNCS. http://hdl.handle.net/20.500.12708/57521

2017

• Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem / Kloimüllner, C., & Raidl, G. (2017). Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem. In Conference Proceedings of Learning and Intelligent Optimization Conference (pp. 1–16). http://hdl.handle.net/20.500.12708/57287
• Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control / Kloimüllner, C., & Raidl, G. (2017). Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control. In Evolutionary Computation in Combinatorial Optimization (pp. 91–107). Evolutionary Computation in Combinatorial Optimization. http://hdl.handle.net/20.500.12708/57288
• GRASP and VNS for a periodic VRP with time windows to deal with milk collection / Exposit, A., Raidl, G., Brito, J., & Moreno-Perez, J. (2017). GRASP and VNS for a periodic VRP with time windows to deal with milk collection. In Computer Aided Systems Theory - EUROCAST 2017 (pp. 90–91). http://hdl.handle.net/20.500.12708/57289
• Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments / Maschler, J., Riedler, M., & Raidl, G. (2017). Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments. In Computer Aided Systems Theory - EUROCAST 2017 (pp. 106–107). http://hdl.handle.net/20.500.12708/57296
• Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment / Horn, M., Raidl, G., & Blum, C. (2017). Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment. In Machine Learning, Optimization, and Big Data Third International Conference, MOD 2017, Volterra, Italy, September 14–17, 2017, Revised Selected Papers (pp. 506–518). LNCS. https://doi.org/10.1007/978-3-319-72926-8_42
• A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem / Dusberger, F., & Raidl, G. (2017). A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem. In Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (pp. 385–391). Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies. http://hdl.handle.net/20.500.12708/57290
• Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition / Kloimüllner, C., & Raidl, G. (2017). Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition. Networks, 69(3), 270–289. http://hdl.handle.net/20.500.12708/147719
• An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem / Maschler, J., Hackl, T., Riedler, M., & Raidl, G. (2017). An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem. In Proceedings of the 12th Metaheuristics International Conference (MIC 2017) (pp. 463–472). http://hdl.handle.net/20.500.12708/57298
• Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm / Pop, P., Cosmin, S., Biesinger, B., Hu, B., & Raidl, G. (2017). Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm. Carpathian Journal of Mathematics, 33(3), 365–371. http://hdl.handle.net/20.500.12708/147704
• An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem / Riedler, M., Jatschka, T., Maschler, J., & Raidl, G. (2017). An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem. International Transactions in Operational Research, 8. http://hdl.handle.net/20.500.12708/147676
• An Iterative Time-Bucket Refinement Algorithm for a Resource-Constrained Project Scheduling Problem / Raidl, G. (2017). An Iterative Time-Bucket Refinement Algorithm for a Resource-Constrained Project Scheduling Problem. TU Graz, Institute for Discrete Mathematics, TU Graz, Institute for Discrete Mathematics, Austria. http://hdl.handle.net/20.500.12708/86688
• Mixed Integer Programming Approaches for Resource-Constrained Project Scheduling / Raidl, G. (2017). Mixed Integer Programming Approaches for Resource-Constrained Project Scheduling. University of Vienna, Department of Statistics and Operations Research, University of Vienna, Department of Statistics and Operations Research, Austria. http://hdl.handle.net/20.500.12708/86687
• Hybrid Metaheuristics for Optimization Problems in Public Bike Sharing Systems / Raidl, G. (2017). Hybrid Metaheuristics for Optimization Problems in Public Bike Sharing Systems. http://hdl.handle.net/20.500.12708/39377

2016

• Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers / Klocker, B., Fleischner, H., & Raidl, G. (2016). Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. In M. J. Blesa, C. Blum, A. Cangelosi, V. Cutello, A. Di Nuovo, M. Pavone, & E.-G. Talbi (Eds.), Hybrid Metaheuristics - 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings (pp. 1–16). LNCS. https://doi.org/10.1007/978-3-319-39636-1_1
• Districting and Routing for Security Control / Prischink, M., Kloimüllner, C., Biesinger, B., & Raidl, G. R. (2016). Districting and Routing for Security Control. In Hybrid Metaheuristics (pp. 87–103). LNCS. https://doi.org/10.1007/978-3-319-39636-1_7
• An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands / Biesinger, B., Hu, B., & Raidl, G. (2016). An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands. In Electronic Notes in Discrete Mathematics (pp. 245–252). Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2016.03.033
• Particle Therapy Patient Scheduling: First Heuristic Approaches / Maschler, J., Riedler, M., Stock, M., & Raidl, G. (2016). Particle Therapy Patient Scheduling: First Heuristic Approaches. In PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling (pp. 223–244). http://hdl.handle.net/20.500.12708/56854
• A Multi-Commodity FLow Based Model for Multi Layer Hierarchical Ring Network Design / Schauer, C., & Raidl, G. (2016). A Multi-Commodity FLow Based Model for Multi Layer Hierarchical Ring Network Design. In Proceedings of INOC 2015 - 7th International Network Optimization Conference (pp. 189–196). http://hdl.handle.net/20.500.12708/56834
• Cyclic Giant Tour Decoding for the EVRPTW / Bacher, C., & Raidl, G. (2016). Cyclic Giant Tour Decoding for the EVRPTW. European Conference on Operational Research, Vilnius, Lithuania. http://hdl.handle.net/20.500.12708/86418
• Particle Therapy Patient Scheduling: First Heuristic Approaches / Maschler, J., Riedler, M., Stock, M., & Raidl, G. (2016). Particle Therapy Patient Scheduling: First Heuristic Approaches. European Conference on Operational Research, Vilnius, Lithuania. http://hdl.handle.net/20.500.12708/86452
• Algorithms for Vehicle Routing / Raidl, G. (2016). Algorithms for Vehicle Routing. Workshop on Advances and Improvements in Service Delivery to Regional Development: Cases of Transportation and Health, La Laguna, Spain. http://hdl.handle.net/20.500.12708/86459
• New developments in metaheuristics and their applications / Lau, H. C., Raidl, G., & Van Hentenryck, P. (2016). New developments in metaheuristics and their applications. Journal of Heuristics, 22(4), 359–363. http://hdl.handle.net/20.500.12708/149930
• Large Neighborhood Search for the Most Strings with Few Bad Columns Problem / Lizárraga, E., Blesa, M. J., Blum, C., & Raidl, G. R. (2016). Large Neighborhood Search for the Most Strings with Few Bad Columns Problem. Journal of Heuristics, 21(17), 4901–4915. https://doi.org/10.1007/s00500-016-2379-4
• Models and algorithms for competitive facility location problems with different customer behavior. / Biesinger, B., Hu, B., & Raidl, G. (2016). Models and algorithms for competitive facility location problems with different customer behavior. Annals of Mathematics and Artificial Intelligence, 76(1–2), 93–119. https://doi.org/10.1007/s10472-014-9448-0
  Project: Solution Archives in Evolutionary Combinatorial Optimization (2012–2016)
• Integrating Algebraic Dynamic Programming in Combinatorial Optimization / Bacher, C., & Raidl, G. (2016). Integrating Algebraic Dynamic Programming in Combinatorial Optimization. Austrian Workshop on Metaheuristics, Graz, Austria. http://hdl.handle.net/20.500.12708/86419
• Heuristic Approaches for Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers / Klocker, B., & Raidl, G. (2016). Heuristic Approaches for Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. Austrian Workshop on Metaheuristics, Graz, Austria. http://hdl.handle.net/20.500.12708/86436
• Hybrid Metaheuristics / Blum, C., & Raidl, G. (2016). Hybrid Metaheuristics. Springer. https://doi.org/10.1007/978-3-319-30883-8
• Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics / Raidl, G., Jatschka, T., Riedler, M., & Maschler, J. (2016). Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics. In Proceedings of the Sixth International Workshop on Model-based Metaheuristics (pp. 104–107). http://hdl.handle.net/20.500.12708/56887
• A Logic-based Benders Decomposition Approach for the 3-Staged Strip Packing Problem / Maschler, J., & Raidl, G. (2016). A Logic-based Benders Decomposition Approach for the 3-Staged Strip Packing Problem. In Operations Research Proceedings 2015 Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (pp. 85–102). http://hdl.handle.net/20.500.12708/56847

2015

• Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure / Grujicic, I., Raidl, G., & Schöbel, A. (2015). Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure. Electronic Notes in Discrete Mathematics, 47, 141–148. https://doi.org/10.1016/j.endm.2014.11.019
• Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search / Dusberger, F., & Raidl, G. R. (2015). Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search. In B. Jarboui, A. Sifaleras, & A. Rebai (Eds.), Electronic Notes in Discrete Mathematics (pp. 133–140). Elsevier Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2014.11.018
• Boosting an exact logic-based benders decomposition approach by variable neighborhood search. / Raidl, G., Baumhauer, T., & Hu, B. (2015). Boosting an exact logic-based benders decomposition approach by variable neighborhood search. In B. Jarboui, A. Sifaleras, & A. Rebai (Eds.), Electronic Notes in Discrete Mathematics (pp. 1–4). Elsevier Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2014.11.001
• On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics / Lizarraga, E., Blesa, M. J., Blum, C., & Raidl, G. (2015). On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics. In D. Camacho (Ed.), Innovations in Intelligent Systems and Applications (INISTA), 2015 International Symposium on (pp. 1–8). http://hdl.handle.net/20.500.12708/56227
• A New Solution Representation for the Firefighter Problem / Hu, B., Windbichler, A., & Raidl, G. (2015). A New Solution Representation for the Firefighter Problem. In G. Ochoa & F. Chicano (Eds.), Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015 (pp. 25–35). http://hdl.handle.net/20.500.12708/56226
• Solving the Longest Common Subsequence Problem Using a Parallel Ant Colony Optimization Algorithm / Markvica, D., Schauer, C., & Raidl, G. (2015). Solving the Longest Common Subsequence Problem Using a Parallel Ant Colony Optimization Algorithm. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 113–114). http://hdl.handle.net/20.500.12708/56225
• Metaheuristics for the Two-Dimensional Container-Pre-Marshalling-Problem / Tus, A., Rendl, A., & Raidl, G. (2015). Metaheuristics for the Two-Dimensional Container-Pre-Marshalling-Problem. In C. Dhaenens, L. Jourdan, & M.-E. Marmion (Eds.), Learning and Intelligent Optimization (pp. 186–201). http://hdl.handle.net/20.500.12708/56224
• A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems / Kloimüllner, C., Papazek, P., Raidl, G., & Hu, B. (2015). A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 125–126). http://hdl.handle.net/20.500.12708/56222
• A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size / Dusberger, F., & Raidl, G. (2015). A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size. In A. Quesada-Arencibia, J. C. Rodriguez, R. Moreno-Díaz, & R. Jr. Moreno-Díaz (Eds.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 109–110). http://hdl.handle.net/20.500.12708/56207
• Heuristic Approaches for the Probabilistic Traveling Salesman Problem / Biesinger, B., Weiler, C., Hu, B., & Raidl, G. (2015). Heuristic Approaches for the Probabilistic Traveling Salesman Problem. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 99–100). http://hdl.handle.net/20.500.12708/56204
• A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles / Bacher, C., & Raidl, G. (2015). A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 119–120). http://hdl.handle.net/20.500.12708/56203
• A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands / Biesinger, B., Hu, B., & Raidl, G. R. (2015). A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands. In G. Ochoa & F. Chicano (Eds.), Evolutionary Computation in Combinatorial Optimization (pp. 48–60). Springer. https://doi.org/10.1007/978-3-319-16468-7_5
  Project: Solution Archives in Evolutionary Combinatorial Optimization (2012–2016)
• Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Problem / Blum, C., & Raidl, G. R. (2015). Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Problem. Optimization Letters, 10(1), 189–205. https://doi.org/10.1007/s11590-015-0921-4
• Analyzing Decoding Strategies in a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem / Schauer, C., & Raidl, G. (2015). Analyzing Decoding Strategies in a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 81–82). http://hdl.handle.net/20.500.12708/56328
• Decomposition based hybrid metaheuristics / Raidl, G. R. (2015). Decomposition based hybrid metaheuristics. European Journal of Operational Research, 244(1), 66–76. https://doi.org/10.1016/j.ejor.2014.12.005
• A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem / Biesinger, B., Hu, B., & Raidl, G. (2015). A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem. Journal of Heuristics, 21(3), 391–431. https://doi.org/10.1007/s10732-015-9282-5
  Project: Solution Archives in Evolutionary Combinatorial Optimization (2012–2016)
• Numerische Optimierung elektrifizierter Antriebsstränge / Krenek, T., Bacher, C., Raidl, G., & Lauer, T. (2015). Numerische Optimierung elektrifizierter Antriebsstränge. MTZ: Verbrennungsmotor Und Gasturbine, 76(3), 66–74. https://doi.org/10.1007/s35146-015-0007-y
• Numerical Optimization of Electro Hybrid Powertrains / Krenek, T., Bacher, C., Raidl, G., & Lauer, T. (2015). Numerical Optimization of Electro Hybrid Powertrains. MTZ Worldwide, 76(3), 46–52. https://doi.org/10.1007/s38311-015-0007-9
• Mixed Integer Programming Models for Hybrid Electric Vehicle Routing / Bacher, C., & Raidl, G. (2015). Mixed Integer Programming Models for Hybrid Electric Vehicle Routing. VeroLog 2015, Universität Wien, Austria. http://hdl.handle.net/20.500.12708/86135

2014

• A Memetic Algorithm for the Virtual Network Mapping Problem. / Inführ, J., & Raidl, G. (2014). A Memetic Algorithm for the Virtual Network Mapping Problem. Journal of Heuristics, 22(4), 475–505. https://doi.org/10.1007/s10732-014-9274-x
• An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior / Biesinger, B., Hu, B., & Raidl, G. (2014). An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior. In P. M. Pardalos, M. G. Resende, C. Vogiatzis, & J. L. Walteros (Eds.), Learning and Intelligent Optimization 8th International Conference, Lion 8, Gainesville, FL, USA, February 16-21, 2014. Revised Selected Papers (pp. 203–217). https://doi.org/10.1007/978-3-319-09584-4_19
• Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. / Kloimüllner, C., Papazek, P., Hu, B., & Raidl, G. (2014). Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. In C. Blum & G. Ochoa (Eds.), Evolutionary Computation in Combinatorial Optimization 14th European Conference, EvoCOP 2014, Granada, Spain, April 23-25, 2014, Revised Selected Papers. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-44320-0_7
  Project: BBSS (2011–2016)
• Balancing bicycle sharing systems: An analysis of path relinking and recombination within a GRASP hybrid. / Papazek, P., Kloimüllner, C., Hu, B., & Raidl, G. (2014). Balancing bicycle sharing systems: An analysis of path relinking and recombination within a GRASP hybrid. In T. Bartz - Beielstein, J. Branke, B. Filipic, & J. Smith (Eds.), Parallel Problem Solving from Nature -- PPSN XIII : 13th International Conference, Ljubljana, Slovenia, September 13-17,2014, Proceedings (pp. 792–801). Lecture Notes in Computer Science, Springer International Publishing. https://doi.org/10.1007/978-3-319-10762-2_78
  Project: BBSS (2011–2016)
• PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. / Rainer-Harbach, M., Papazek, P., Raidl, G. R., Hu, B., & Kloimüllner, C. (2014). PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. Journal of Global Optimization, 63(3), 597–629. https://doi.org/10.1007/s10898-014-0147-5
• Variable Neighborhood Search Hybrids / Raidl, G. (2014). Variable Neighborhood Search Hybrids. VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien, Non-EU. http://hdl.handle.net/20.500.12708/85983
• Balancing Bicycle Sharing Systems / Kloimüllner, C., Papazek, P., Hu, B., & Raidl, G. (2014). Balancing Bicycle Sharing Systems. EULOG 2014, Wien, Austria. http://hdl.handle.net/20.500.12708/85933
• A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure / Grujicic, I., Raidl, G., Schöbel, A., & Besau, G. (2014). A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure. In S. Lakusic (Ed.), Road and Rail Infrastructure III, Proceedings of the Conference CETRA 2014 (pp. 691–696). Department of Transportation, University of Zagreb. http://hdl.handle.net/20.500.12708/61314
• A metaheuristic approach for integrated timetable based design of railway infrastructure / Grujicic, I., Raidl, G., Schöbel, A., & Besau, G. (2014). A metaheuristic approach for integrated timetable based design of railway infrastructure. In S. Lakusic (Ed.), Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA 2014 (pp. 691–696). http://hdl.handle.net/20.500.12708/55215
• A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. / Dusberger, F., & Raidl, G. (2014). A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. In M. J. Blesa, C. Blum, & S. Voß (Eds.), Hybrid Metaheuristics (pp. 183–197). LNCS / Springer. https://doi.org/10.1007/978-3-319-07644-7_14
• Speeding Up Logic-Based Benders’ Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem / Raidl, G. R., Baumhauer, T., & Hu, B. (2014). Speeding Up Logic-Based Benders’ Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem. In M. J. Blesa, C. Blum, & S. Voß (Eds.), Hybrid Metaheuristics (pp. 183–197). https://doi.org/10.1007/978-3-319-07644-7_14
• An SME Transition from Plan-Driven to Hybrid Project Management with Agile Software Development Methods / Biffl, S., Mordinyi, R., Raidl, G., Steininger, H., & Winkler, D. (2014). An SME Transition from Plan-Driven to Hybrid Project Management with Agile Software Development Methods. In Proceedings of the 21th EuroSPI Conference on Systems Software and Service Process Improvement, Industrial Track. 21th EuroSPI Conference on Systems Software and Service Process Improvement, Industrial Track, Luxembourg, Luxemburg, EU. Delta. http://hdl.handle.net/20.500.12708/55762
• Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles / Bacher, C., Krenek, T., & Raidl, G. R. (2014). Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles. In A. I. Esparcia-Alcázar & A. M. Mora (Eds.), Applications of Evolutionary Computation (pp. 553–564). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-45523-4_45

2013

• Stabilizing branch-and-price for constrained tree problems / Leitner, M., Ruthmair, M., & Raidl, G. (2013). Stabilizing branch-and-price for constrained tree problems. Networks, 61(2), 150–170. http://hdl.handle.net/20.500.12708/155748
• Metaheuristics for solving a multimodal home-healthcare scheduling problem / Hiermann, G., Prandtstetter, M., Rendl, A., Puchinger, J., & Raidl, G. R. (2013). Metaheuristics for solving a multimodal home-healthcare scheduling problem. Central European Journal of Operations Research, 23(1), 89–113. https://doi.org/10.1007/s10100-013-0305-8
• A timeslot-filling based heuristic approach to construct high-school timetables / Pimmer, M., & Raidl, G. (2013). A timeslot-filling based heuristic approach to construct high-school timetables. In Advances in Metaheuristics (pp. 143–158). Springer. http://hdl.handle.net/20.500.12708/28150
• Optimization Approaches for Balancing Bicycle Sharing Systems / Raidl, G. (2013). Optimization Approaches for Balancing Bicycle Sharing Systems. Department of Business Administration, Production and Operations Management Group, University of Vienna, Wien, Austria. http://hdl.handle.net/20.500.12708/85752
• Metaheuristics for the Static Balancing of Bicycle Sharing Systems / Raidl, G. (2013). Metaheuristics for the Static Balancing of Bicycle Sharing Systems. European Conference on Operational Research, Vilnius, Litauen, EU. http://hdl.handle.net/20.500.12708/85751
• Metaheuristics and Hybrid Optimization Approaches - A Unifying View / Raidl, G. (2013). Metaheuristics and Hybrid Optimization Approaches - A Unifying View. European Conference on Operational Research, Vilnius, Litauen, EU. http://hdl.handle.net/20.500.12708/85750
• An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure / Schöbel, A., Raidl, G., Grujicic, I., Besau, G., & Schuster, G. (2013). An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure. In Proceedings (p. 10). http://hdl.handle.net/20.500.12708/61049
• Using optimized virtual network embedding for network dimensioning / Inführ, J., Stezenbach, D., Hartmann, M., Tutschku, K., & Raidl, G. (2013). Using optimized virtual network embedding for network dimensioning. In Proceedings of Networked Systems 2013 (pp. 118–125). IEEE Computer Society. http://hdl.handle.net/20.500.12708/54824
• Solving the virtual network mapping problem with construction heuristics, local search and variable neighborhood descent / Inführ, J., & Raidl, G. (2013). Solving the virtual network mapping problem with construction heuristics, local search and variable neighborhood descent. In Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013 (pp. 250–261). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/54822
• A memetic algorithm for the virtual network mapping problem / Inführ, J., & Raidl, G. (2013). A memetic algorithm for the virtual network mapping problem. In Proceedings of the 10th Metaheuristics International Conference (p. 10). http://hdl.handle.net/20.500.12708/54820
• GRASP and variable neighborhood search for the virtual network mapping problem / Inführ, J., & Raidl, G. (2013). GRASP and variable neighborhood search for the virtual network mapping problem. In Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (pp. 159–173). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/54819
• A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem / Pop, P., Hu, B., & Raidl, G. (2013). A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. In Computer Aided Systems Theory - EUROCAST 2013 - Part 1 (pp. 219–226). Springer. http://hdl.handle.net/20.500.12708/55036
• A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems / Papazek, P., Raidl, G., Rainer-Harbach, M., & Hu, B. (2013). A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems. In Computer Aided Systems Theory - EUROCAST 2013 - Part 1 (pp. 372–379). Springer. http://hdl.handle.net/20.500.12708/55035
• Clique and independent set based grasp approaches for the regenerator location problem / Jahrmann, P., & Raidl, G. (2013). Clique and independent set based grasp approaches for the regenerator location problem. In Proceedings of the 10th Metaheuristics International Conference (pp. 1–10). http://hdl.handle.net/20.500.12708/55032
• Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents / Biesinger, B., Schauer, C., Hu, B., & Raidl, G. (2013). Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents. In Computer Aided Systems Theory - EUROCAST 2013 - Part 1 (pp. 380–387). Springer. http://hdl.handle.net/20.500.12708/55033
• A memetic algorithm for the partition graph coloring problem / Pop, P., Hu, B., & Raidl, G. (2013). A memetic algorithm for the partition graph coloring problem. In Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory (pp. 167–169). http://hdl.handle.net/20.500.12708/55030
• A pilot/vnd/grasp hybrid for balancing bicycle sharing systems / Papazek, P., Raidl, G., Rainer-Harbach, M., & Hu, B. (2013). A pilot/vnd/grasp hybrid for balancing bicycle sharing systems. In Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory (pp. 223–225). http://hdl.handle.net/20.500.12708/55029
• A mixed integer model for the stamina-aware sightseeing tour problem / Hu, B., Ölz, W., & Raidl, G. (2013). A mixed integer model for the stamina-aware sightseeing tour problem. In Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory (pp. 200–202). http://hdl.handle.net/20.500.12708/55028
• Reconstructing cross cut shredded documents with a genetic algorithm with solution archive / Biesinger, B., Schauer, C., Hu, B., & Raidl, G. (2013). Reconstructing cross cut shredded documents with a genetic algorithm with solution archive. In Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory (pp. 226–228). http://hdl.handle.net/20.500.12708/55027
• Balancing bicycle sharing systems: A variable neighborhood search approach / Rainer-Harbach, M., Papazek, P., Hu, B., & Raidl, G. (2013). Balancing bicycle sharing systems: A variable neighborhood search approach. In Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013 (pp. 121–132). http://hdl.handle.net/20.500.12708/55026
• Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations / Raidl, G., Hu, B., Rainer-Harbach, M., & Papazek, P. (2013). Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations. In Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (pp. 130–143). http://hdl.handle.net/20.500.12708/55025
• Proceedings of the 10th Metaheuristics International Conference / Lau, H. C., Raidl, G., & Van Hentenryck, P. (Eds.). (2013). Proceedings of the 10th Metaheuristics International Conference. Singapore Management University. http://hdl.handle.net/20.500.12708/23726

2012

• A variable neighborhood search approach for the two-echelon location-routing problem / Schwengerer, M., Pirkwieser, S., & Raidl, G. (2012). A variable neighborhood search approach for the two-echelon location-routing problem. In Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2012 (pp. 13–24). http://hdl.handle.net/20.500.12708/54401
• A hybrid heuristic for multimodal homecare scheduling / Rendl, A., Prandtstetter, M., Hiermann, G., Puchinger, J., & Raidl, G. (2012). A hybrid heuristic for multimodal homecare scheduling. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (pp. 339–355). http://hdl.handle.net/20.500.12708/54406
• Solving the post enrolment course timetabling problem by ant colony optimization / Nothegger, C., Mayer, A., Chwatal, A., & Raidl, G. R. (2012). Solving the post enrolment course timetabling problem by ant colony optimization. Annals of Operations Research, 194(1), 325–339. https://doi.org/10.1007/s10479-012-1078-5
• An Adaptive Layers Framework for Resource-Constrained Network Design Problems / Ruthmair, M., & Raidl, G. (2012). An Adaptive Layers Framework for Resource-Constrained Network Design Problems. INFORMS Telecommunications Conference, Boca Raton, Florida, USA, Non-EU. http://hdl.handle.net/20.500.12708/85473
• An Adaptive Layers Framework for Vehicle Routing Problems / Ruthmair, M., & Raidl, G. (2012). An Adaptive Layers Framework for Vehicle Routing Problems. International Symposium on Mathematical Programming, Berlin, Deutschland, EU. http://hdl.handle.net/20.500.12708/85466
• Hybrid Metaheuristics and Matheuristics / Raidl, G. (2012). Hybrid Metaheuristics and Matheuristics. International Conference on Metaheuristics and Nature Inspired Computing, Port El-Kantaoiui, Tunisia, Non-EU. http://hdl.handle.net/20.500.12708/85481
• Balancing Bicycle Sharing Systems by Variable Neighborhood Search / Raidl, G., Causevic, E., Hu, B., & Rainer-Harbach, M. (2012). Balancing Bicycle Sharing Systems by Variable Neighborhood Search. EUROmC XXVIII VNS, Herceg Novi, Montenegro, Non-EU. http://hdl.handle.net/20.500.12708/85480
• On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem / Ruthmair, M., & Raidl, G. (2012). On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem. In Proceedings of the 2nd International Symposium on Combinatorial Optimization (pp. 225–236). http://hdl.handle.net/20.500.12708/54404
• Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design / Schauer, C., & Raidl, G. (2012). Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design. In Parallel Problem Solving from Nature-PPSN XII (pp. 458–467). http://hdl.handle.net/20.500.12708/54405
• Improved packing and routing of vehicles with compartments / Pirkwieser, S., Raidl, G., & Gottlieb, J. (2012). Improved packing and routing of vehicles with compartments. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 392–399). http://hdl.handle.net/20.500.12708/54400
• Applying (hybrid) metaheuristics to fuel consumption optimization of hybrid electric vehicles / Krenek, T., Ruthmair, M., Raidl, G., & Planer, M. (2012). Applying (hybrid) metaheuristics to fuel consumption optimization of hybrid electric vehicles. In Applications of Evolutionary Computation - EvoApplications 2012 (pp. 376–385). http://hdl.handle.net/20.500.12708/54398
• Automatic generation of 2-antwars players with genetic programming / Inführ, J., & Raidl, G. (2012). Automatic generation of 2-antwars players with genetic programming. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 248–255). http://hdl.handle.net/20.500.12708/54385
• An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem / Hu, B., & Raidl, G. (2012). An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference - GECCO ’12. GECCO: Genetic and Evolutionary Computation Conference, Seattle, Non-EU. https://doi.org/10.1145/2330163.2330220
• An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem / Hu, B., & Raidl, G. (2012). An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 287–294). http://hdl.handle.net/20.500.12708/54377
• A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / Berlakovich, M., Ruthmair, M., & Raidl, G. (2012). A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 256–263). http://hdl.handle.net/20.500.12708/54296

2011

• Hybrid metaheuristics in combinatorial optimization: A survey / Blum, C., Puchinger, J., Raidl, G. R., & Roli, A. (2011). Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing, 11(6), 4135–4151. https://doi.org/10.1016/j.asoc.2011.02.032
• A timeslot-filling based heuristic approach to construct high-school timetables / Pimmer, M., & Raidl, G. (2011). A timeslot-filling based heuristic approach to construct high-school timetables. In Proceedings of the 9th Metaheuristics International Conference (pp. 349–358). http://hdl.handle.net/20.500.12708/53810
• Solving the minimum label spanning tree problem by mathematical programming techniques / Chwatal, A. M., & Raidl, G. R. (2011). Solving the minimum label spanning tree problem by mathematical programming techniques. Advances in Operations Research, 2011, 1–38. https://doi.org/10.1155/2011/143732
• A branch-and-cut-and-price algorithm for a fingerprint-template compression application / Chwatal, A., Thöni, C., Oberlechner, K., & Raidl, G. (2011). A branch-and-cut-and-price algorithm for a fingerprint-template compression application. In Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS) (pp. 239–246). http://hdl.handle.net/20.500.12708/53804
• Branch-and-cut-and-price for capacitated connected facility location / Leitner, M., & Raidl, G. R. (2011). Branch-and-cut-and-price for capacitated connected facility location. Journal of Mathematical Modelling and Algorithms, 10(3), 245–267. https://doi.org/10.1007/s10852-011-9153-5
• Tackling the loading aspect of the vehicle routing problem with compartments / Pirkwieser, S., Raidl, G., & Gottlieb, J. (2011). Tackling the loading aspect of the vehicle routing problem with compartments. In Proceedings of the 9th Metaheuristics International Conference (pp. 679–681). http://hdl.handle.net/20.500.12708/53845
• A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems / Ruthmair, M., & Raidl, G. (2011). A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. In Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV) (pp. 376–388). http://hdl.handle.net/20.500.12708/53813
• Stabilized column generation for the rooted delay-constrained Steiner tree problem / Leitner, M., Ruthmair, M., & Raidl, G. (2011). Stabilized column generation for the rooted delay-constrained Steiner tree problem. In Proceedings of the VII ALIO/EURO - Workshop on Applied Combinatorial Optimization (pp. 250–253). http://hdl.handle.net/20.500.12708/53807
• Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem / Leitner, M., Ruthmair, M., & Raidl, G. (2011). Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem. In Network Optimization: 5th International Conference, INOC 2011 (pp. 124–138). http://hdl.handle.net/20.500.12708/53806
• A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem / Ruthmair, M., & Raidl, G. (2011). A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 351–358). http://hdl.handle.net/20.500.12708/53781
• Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem / Ruthmair, M., Hubmer, A., & Raidl, G. (2011). Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 285–287). http://hdl.handle.net/20.500.12708/53779
• Variable neighborhood search for capacitated connected facility location / Leitner, M., & Raidl, G. (2011). Variable neighborhood search for capacitated connected facility location. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 261–263). http://hdl.handle.net/20.500.12708/53778
• Improved packing and routing of vehicles with compartments / Pirkwieser, S., Raidl, G., & Gottlieb, J. (2011). Improved packing and routing of vehicles with compartments. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 302–304). Universidad de Las Palmas de Gran Canaria. http://hdl.handle.net/20.500.12708/53777
• Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location / Leitner, M., & Raidl, G. (2011). Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 295–302). http://hdl.handle.net/20.500.12708/53776
• Introducing the virtual network mapping problem with delay, routing and location constraints / Inführ, J., & Raidl, G. (2011). Introducing the virtual network mapping problem with delay, routing and location constraints. In Network Optimization: 5th International Conference (pp. 105–117). http://hdl.handle.net/20.500.12708/53774
• Automatic generation of 2-AntWars players with Genetic Programming / Inführ, J., & Raidl, G. (2011). Automatic generation of 2-AntWars players with Genetic Programming. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 244–246). http://hdl.handle.net/20.500.12708/53773
• An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem / Hu, B., & Raidl, G. (2011). An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 256–258). http://hdl.handle.net/20.500.12708/53772
• A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / Berlakovich, M., Ruthmair, M., & Raidl, G. (2011). A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 247–249). http://hdl.handle.net/20.500.12708/53768

2010

• Trend-based similarity search in time-series data / Suntinger, M., Obweger, H., Schiefer, J., Limbeck, P., & Raidl, G. (2010). Trend-based similarity search in time-series data. In Proceedings of the Second International Conference on Advances in Database, Knowledge, and Data Applications - DBKDA 2010 (pp. 97–106). http://hdl.handle.net/20.500.12708/53291
• Similarity searching in sequences of complex events / Obweger, H., Suntinger, M., Schiefer, J., & Raidl, G. (2010). Similarity searching in sequences of complex events. In Proceedings of the Fourth International Conference on Research Challenges in Information Science - RCIS 2010 (pp. 631–639). http://hdl.handle.net/20.500.12708/53281
• The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search / Hu, B., Leitner, M., & Raidl, G. (2010). The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search. Networks, 55(3), 257–275. http://hdl.handle.net/20.500.12708/167297
• The multidimensional knapsack problem: Structure and algorithms / Puchinger, J., Raidl, G., & Pferschy, U. (2010). The multidimensional knapsack problem: Structure and algorithms. INFORMS Journal on Computing, 22(2), 250–265. http://hdl.handle.net/20.500.12708/167303
• A brief survey on hybrid metaheuristics / Blum, C., Puchinger, J., Raidl, G., & Roli, A. (2010). A brief survey on hybrid metaheuristics. In Proceedings of BIOMA 2010 - 4th International Conference on Bioinspired Optimization Methods and their Applications (pp. 3–16). Jozef Stefan Institute. http://hdl.handle.net/20.500.12708/53274
• Hybrid metaheuristics / Blum, C., Puchinger, J., Raidl, G., & Roli, A. (2010). Hybrid metaheuristics. In Hybrid Optimization -The Ten Years of CPAIOR (pp. 305–336). Springer. http://hdl.handle.net/20.500.12708/26905
• A memetic algorithm for reconstructing cross-cut shredded text documents / Schauer, C., Prandtstetter, M., & Raidl, G. (2010). A memetic algorithm for reconstructing cross-cut shredded text documents. In Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010 (pp. 103–117). http://hdl.handle.net/20.500.12708/53290
• Fitting multi-planet transit models to photometric time-data series by evolution strategies / Chwatal, A., Raidl, G., & Zöch, M. (2010). Fitting multi-planet transit models to photometric time-data series by evolution strategies. In Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (p. 7). http://hdl.handle.net/20.500.12708/53275
• Solving the minimum label spanning tree problem by ant colony optimization / Chwatal, A., & Raidl, G. (2010). Solving the minimum label spanning tree problem by ant colony optimization. In Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods (pp. 91–97). http://hdl.handle.net/20.500.12708/53276
• Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem / Ruthmair, M., & Raidl, G. (2010). Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem. In Parallel Problem Solving from Nature - PPSN XI (pp. 391–400). http://hdl.handle.net/20.500.12708/53289
• Enhancing genetic algorithms by a trie-based complete solution archive / Raidl, G., & Hu, B. (2010). Enhancing genetic algorithms by a trie-based complete solution archive. In Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010 (pp. 239–251). http://hdl.handle.net/20.500.12708/53288
• Variable neighborhood search coupled with ILP-based large neighborhood searches for the (periodic) location-routing problem / Pirkwieser, S., & Raidl, G. (2010). Variable neighborhood search coupled with ILP-based large neighborhood searches for the (periodic) location-routing problem. In Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010 (pp. 174–189). http://hdl.handle.net/20.500.12708/53285
• Matheuristics for the periodic vehicle routing problem with time windows / Pirkwieser, S., & Raidl, G. (2010). Matheuristics for the periodic vehicle routing problem with time windows. In Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics, (pp. 83–95). http://hdl.handle.net/20.500.12708/53283
• Multilevel variable neighborhood search for periodic routing problems / Pirkwieser, S., & Raidl, G. (2010). Multilevel variable neighborhood search for periodic routing problems. In Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010 (pp. 226–238). http://hdl.handle.net/20.500.12708/53284
• A memetic algorithm with population management for the generalized minimum vertex-biconnected network problem / Pagacz, A., Hu, B., & Raidl, G. (2010). A memetic algorithm with population management for the generalized minimum vertex-biconnected network problem. In 2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design (pp. 356–361). http://hdl.handle.net/20.500.12708/53282
• Strong lower bounds for a survivable network design problem / Leitner, M., & Raidl, G. (2010). Strong lower bounds for a survivable network design problem. In ISCO 2010 - International Symposium on Combinatorial Optimization (pp. 295–302). http://hdl.handle.net/20.500.12708/53278
• Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 / Blesa, M. J., Blum, C., Raidl, G., Roli, A., & Sampels, M. (Eds.). (2010). Hybrid Metaheuristics, 7th Int. Workshop, HM 2010. Springer. http://hdl.handle.net/20.500.12708/23160

2009

• MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics / Puchinger, J., Raidl, G., & Pirkwieser, S. (2009). MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics. In Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,Volume 10 of Annals of Information Systems (pp. 71–102). Springer. http://hdl.handle.net/20.500.12708/26527
• Solving a video-server load re-balancing problem by mixed integer programming and hybrid variable neighborhood search / Walla, J., Ruthmair, M., & Raidl, G. (2009). Solving a video-server load re-balancing problem by mixed integer programming and hybrid variable neighborhood search. In Hybrid Metaheuristics 2009, volume 5818 of LNCS (pp. 84–99). http://hdl.handle.net/20.500.12708/53000
• (Meta-)heuristic separation of jump cuts in a branch&cut approach for the bounded diameter minimum spanning tree problem / Gruber, M., & Raidl, G. (2009). (Meta-)heuristic separation of jump cuts in a branch&cut approach for the bounded diameter minimum spanning tree problem. In Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,volume 10 of Annals of Information Systems (pp. 209–230). Springer. http://hdl.handle.net/20.500.12708/26522
• Computing optimized stock (re-)placements in last-in, first-out warehouses / Ritzinger, U., Prandtstetter, M., & Raidl, G. (2009). Computing optimized stock (re-)placements in last-in, first-out warehouses. In Logistik Management (pp. 279–298). http://hdl.handle.net/20.500.12708/52995
• A hybrid algorithm for computing tours in a spare parts warehouse / Prandtstetter, M., Raidl, G., & Misar, T. (2009). A hybrid algorithm for computing tours in a spare parts warehouse. In Evolutionary Computation in Combinatorial Optimization - EvoCOP 2009 (pp. 25–36). Springer. http://hdl.handle.net/20.500.12708/52690
• Meta-heuristics for reconstructing cross cut shredded text documents / Prandtstetter, M., & Raidl, G. (2009). Meta-heuristics for reconstructing cross cut shredded text documents. In Proceedings of the 11th annual conference on Genetic and evolutionary computation (p. 8). http://hdl.handle.net/20.500.12708/52832
• Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates. / Chwatal, A. M., Raidl, G. R., & Oberlechner, K. (2009). Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates. Journal of Mathematical Modelling and Algorithms, 8(3), 293–334. https://doi.org/10.1007/s10852-009-9109-1
• Solving a multi-constrained network design problem by lagrangean decomposition and column generation / Chwatal, A., Musil, N., & Raidl, G. (2009). Solving a multi-constrained network design problem by lagrangean decomposition and column generation. In Proceedings of the International Network Optimization Conference 2009 (p. 7). http://hdl.handle.net/20.500.12708/52712
• Fitting rectangular signals to time series data by metaheuristic algorithms / Chwatal, A., & Raidl, G. (2009). Fitting rectangular signals to time series data by metaheuristic algorithms. In Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (pp. 222–225). http://hdl.handle.net/20.500.12708/52685
• Fitting multi-planet transit models to corot time-data series by evolutionary algorithms / Chwatal, A., Wuchterl, G., & Raidl, G. (2009). Fitting multi-planet transit models to corot time-data series by evolutionary algorithms. COROT, Paris, EU. http://hdl.handle.net/20.500.12708/84870
• Innovative Lösungen für Routenplanung, Packungsprobleme und Lagerlogistik / Raidl, G. (2009). Innovative Lösungen für Routenplanung, Packungsprobleme und Lagerlogistik. Aktuelles Know-How der TU Wien für Logistik und Distribution, Ausseninstitut-Technologietransfer, Wien, Austria. http://hdl.handle.net/20.500.12708/84922
• Kombinationen von Metaheuristiken und Methoden der mathematischen Programmierung zur Lösung schwieriger Netzwerkdesign-Probleme / Raidl, G. (2009). Kombinationen von Metaheuristiken und Methoden der mathematischen Programmierung zur Lösung schwieriger Netzwerkdesign-Probleme. Upper Austrian University of Applied Sciences, Department of Software Engineering, Hagenberg, Austria. http://hdl.handle.net/20.500.12708/84921
• Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / Raidl, G. (2009). Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems. Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Znaim, Tschechien, EU. http://hdl.handle.net/20.500.12708/84892
• Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / Raidl, G. (2009). Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems. University of Nottingham, School of Computer Science, Nottingham, United Kingdom, EU. http://hdl.handle.net/20.500.12708/84081
• A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / Ruthmair, M., & Raidl, G. (2009). A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Computer Aided Systems Theory - EUROCAST 2009, volume 5717 of LNCS (pp. 713–720). http://hdl.handle.net/20.500.12708/52997
• Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows / Pirkwieser, S., & Raidl, G. (2009). Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In Proceedings of Hybrid Metaheuristics - Sixth International Workshop (pp. 45–59). http://hdl.handle.net/20.500.12708/52831
• Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques / Pirkwieser, S., & Raidl, G. (2009). Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques. In Proceedings of the 8th Metaheuristic International Conference (MIC 2009) (p. 10). http://hdl.handle.net/20.500.12708/52830
• A memetic algorithm for the generalized minimum vertex-biconnected network problem / Hu, B., & Raidl, G. (2009). A memetic algorithm for the generalized minimum vertex-biconnected network problem. In 9th International Conference on Hybrid Intelligent Systems - HIS 2009 (p. 6). http://hdl.handle.net/20.500.12708/52828
• Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics / Gruber, M., & Raidl, G. (2009). Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics. In Computer Aided Systems Theory - EUROCAST 2009, 12th International Conference on Computer Aided Systems Theory (pp. 665–672). http://hdl.handle.net/20.500.12708/52826
• Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on Euclidean instances / Gruber, M., & Raidl, G. (2009). Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on Euclidean instances. In Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (p. 8). http://hdl.handle.net/20.500.12708/52804
• A lagrangian decomposition based heuristic for capacitated connected facility location / Leitner, M., & Raidl, G. (2009). A lagrangian decomposition based heuristic for capacitated connected facility location. In Proceedings of the 8th Metaheuristic International Conference (MIC 2009). Metaheuristic International Conference (MIC), Hamburg, EU. http://hdl.handle.net/20.500.12708/52730
• A column generation approach for the periodic vehicle routing problem with time windows / Pirkwieser, S., & Raidl, G. (2009). A column generation approach for the periodic vehicle routing problem with time windows. In Proceedings of the International Network Optimization Conference 2009 (p. 6). http://hdl.handle.net/20.500.12708/52689
• Accelerating column generation for a survivable network design problem / Leitner, M., Raidl, G., & Pferschy, U. (2009). Accelerating column generation for a survivable network design problem. In Proceedings of the International Network Optimization Conference 2009 (p. 8). http://hdl.handle.net/20.500.12708/52688
• Cluster-based (meta-)heuristics for the Euclidean bounded diameter minimum spanning tree problem / Gruber, M., & Raidl, G. (2009). Cluster-based (meta-)heuristics for the Euclidean bounded diameter minimum spanning tree problem. In Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (pp. 228–231). http://hdl.handle.net/20.500.12708/52686
• A Kruskal-based heuristic for the rooted delay-constrained minimum spanning tree problem / Ruthmair, M., & Raidl, G. (2009). A Kruskal-based heuristic for the rooted delay-constrained minimum spanning tree problem. In Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (pp. 244–246). http://hdl.handle.net/20.500.12708/52687
• Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference / Raidl, G. (Ed.). (2009). Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference. ACM Press. http://hdl.handle.net/20.500.12708/22977

2008

• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization / Raidl, G., & Puchinger, J. (2008). Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In C. Blum, M. J. Blesa Aguilera, A. Roli, & M. Sampels (Eds.), Hybrid Metaheuristics. An Emergent Approach for Combinatorial Optimization (Vol. 114, pp. 31–62). Springer. https://doi.org/10.1007/978-3-540-78295-7_2
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem / Hu, B., Leitner, M., & Raidl, G. (2008). Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. Journal of Heuristics, 14(5), 473–499. http://hdl.handle.net/20.500.12708/171058
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search / Puchinger, J., & Raidl, G. (2008). Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. Journal of Heuristics, 14(5), 457–472. http://hdl.handle.net/20.500.12708/171065
• A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem / Pirkwieser, S., Raidl, G., & Puchinger, J. (2008). A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem. In Recent Advances in Evolutionary Computation for Combinatorial Optimization (pp. 69–85). Springer. http://hdl.handle.net/20.500.12708/26083
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem / Prandtstetter, M., & Raidl, G. (2008). An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. European Journal of Operational Research, 191(3), 1004–1022. http://hdl.handle.net/20.500.12708/171068
• Combining forces to reconstruct strip shredded text documents / Prandtstetter, M., & Raidl, G. (2008). Combining forces to reconstruct strip shredded text documents. In Hybrid Metaheuristics 2008 (pp. 175–189). http://hdl.handle.net/20.500.12708/52609
• Solving the post enrolment course timetabling problem by ant colony optimization / Mayer, A., Nothegger, C., Chwatal, A., & Raidl, G. (2008). Solving the post enrolment course timetabling problem by ant colony optimization. In Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (p. 13). http://hdl.handle.net/20.500.12708/52602
• Exact methods and metaheuristic approaches for deriving high quality fully resolved consensus trees / Pirkwieser, S., Ruiz-Torrubiano, R., & Raidl, G. (2008). Exact methods and metaheuristic approaches for deriving high quality fully resolved consensus trees. BIRD’08 2nd International Conference on Bioinformatics Research and Development, Wien, Austria. http://hdl.handle.net/20.500.12708/84853
• Cooperative Hybrids for Combinatorial Optimization / Raidl, G. (2008). Cooperative Hybrids for Combinatorial Optimization. Int. Workshop on Nature Inspired Cooperative Strategies for Optimization, Puerto de La Cruz, Tenerife, Spain, EU. http://hdl.handle.net/20.500.12708/84849
• Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / Raidl, G. (2008). Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems. First Int. Workshop on Information Network Design, Kitakyushu City, Fukuoka, Japan, Non-EU. http://hdl.handle.net/20.500.12708/84848
• A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem / Raidl, G., & Gruber, M. (2008). A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. In Proceedings of the International Conference on Numerical Analysis and Applied Mathematics (pp. 446–449). http://hdl.handle.net/20.500.12708/52630
• Effective neighborhood structures for the generalized traveling salesman problem / Hu, B., & Raidl, G. (2008). Effective neighborhood structures for the generalized traveling salesman problem. In Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2008 (pp. 36–47). LNCS/Springer Berlin. http://hdl.handle.net/20.500.12708/52610
• Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks / Leitner, M., & Raidl, G. (2008). Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks. In Hybrid Metaheuristics 2008 (pp. 158–174). http://hdl.handle.net/20.500.12708/52607
• A variable neighborhood search for the periodic vehicle routing problem with time windows / Pirkwieser, S., & Raidl, G. (2008). A variable neighborhood search for the periodic vehicle routing problem with time windows. In Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing. EU/MEeting, Troyes, Frankreich, EU. http://hdl.handle.net/20.500.12708/52604
• Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms / Pirkwieser, S., & Raidl, G. (2008). Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. In Proceedings of the 10th annual conference on Genetic and evolutionary computation (pp. 323–330). http://hdl.handle.net/20.500.12708/52603
• Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem / Hu, B., & Raidl, G. (2008). Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem. In 8th International Conference on Hybrid Intelligent Systems (pp. 73–77). http://hdl.handle.net/20.500.12708/52600
• (Meta-)heuristic separation of jump cuts for the bounded diameter minimum spanning tree problem / Gruber, M., & Raidl, G. (2008). (Meta-)heuristic separation of jump cuts for the bounded diameter minimum spanning tree problem. In Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics. Matheuristics2008 - Second International Workshop on Model Based Metaheuristics, Bertinoro, Italien, EU. http://hdl.handle.net/20.500.12708/52598
• Variable neighborhood search for a prize collecting capacity constrained connected facility location problem / Leitner, M., & Raidl, G. (2008). Variable neighborhood search for a prize collecting capacity constrained connected facility location problem. In Proceedings of the 2008 International Symposium on Applications and the Internet (pp. 233–236). IEEE Computer Society. http://hdl.handle.net/20.500.12708/52596
• Heuristic cut separation in a branch&cut approach for the bounded diameter minimum spanning tree problem / Gruber, M., & Raidl, G. (2008). Heuristic cut separation in a branch&cut approach for the bounded diameter minimum spanning tree problem. In Proceedings of the 2008 International Symposium on Applications and the Internet (pp. 261–264). IEEE Computer Society. http://hdl.handle.net/20.500.12708/52551

2007

• CyMATE: A new tool for methylation analysis of plant genomic DNA after bisulfite sequencing / Hetzl, J., Foerster, A. M., Raidl, G., & Mittelsten Scheid, O. (2007). CyMATE: A new tool for methylation analysis of plant genomic DNA after bisulfite sequencing. The Plant Journal, 51(3), 526–536. http://hdl.handle.net/20.500.12708/169659
• A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks / Wagner, D., Pferschy, U., Mutzel, P., Raidl, G., & Bachhiesl, P. (2007). A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks. In Proceedings of the International Network Optimization Conference 2007. International Network Optimization Conference, Spa, Belgien, EU. http://hdl.handle.net/20.500.12708/51928
• A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. / Wagner, D., Raidl, G., Pferschy, U., Mutzel, P., & Bachhiesl, P. (2007). A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. In Operations Research Proceedings 2006, Karlsruhe. Operations Research, Karlsruhe, Deutschland, EU. Springer. http://hdl.handle.net/20.500.12708/51766
• Models and algorithms for three-stage two-dimensional bin packing / Puchinger, J., & Raidl, G. (2007). Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research, 183(3), 1304–1327. http://hdl.handle.net/20.500.12708/169628
• Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem / Pirkwieser, S., Raidl, G., & Puchinger, J. (2007). Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem. In Evolutionary Computation in Combinatorial Optimization: 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings (pp. 176–187). http://hdl.handle.net/20.500.12708/51946
• Reconstructing Sheets of Manually Torn Paper / Prandtstetter, M., Raidl, G., & Schüller, P. (2007). Reconstructing Sheets of Manually Torn Paper. 11th International Workshop on Combinatorial Optimization, Aussois, Frankreich, EU. http://hdl.handle.net/20.500.12708/84603
• Fingerprint template compression by solving a minimum label $k$-node subtree problem / Raidl, G., & Chwatal, A. (2007). Fingerprint template compression by solving a minimum label $k$-node subtree problem. In International Conference of Numerical Analysis and Applied Mathematics (pp. 444–447). http://hdl.handle.net/20.500.12708/51947
• Compressing fingerprint templates by solving an extended minimum label spanning tree problem. / Chwatal, A., Raidl, G., & Dietzel, O. (2007). Compressing fingerprint templates by solving an extended minimum label spanning tree problem. In Proceedings of the Seventh Metaheuristics International Conference (MIC) (p. 3). http://hdl.handle.net/20.500.12708/51853
• Determining orbital elements of extrasolar planets by evolution strategies. / Chwatal, A., & Raidl, G. (2007). Determining orbital elements of extrasolar planets by evolution strategies. In R. Moreno-Díaz (Ed.), EUROCAST 2007 Conference Proceedings, 2007. http://hdl.handle.net/20.500.12708/51852
• Applying branch-and-cut for compressing fingerprint templates / Chwatal, A., & Raidl, G. (2007). Applying branch-and-cut for compressing fingerprint templates. EURO XXII: 22nd European Conference on Operational Research, Prague, EU. http://hdl.handle.net/20.500.12708/84610
• Determining orbital elements of extrasolar planets by evolution strategies. / Chwatal, A., & Raidl, G. (2007). Determining orbital elements of extrasolar planets by evolution strategies. In R. Moreno-Díaz (Ed.), Computer Aided Systems Theory - EUROCAST 2007 (pp. 870–877). Springer. http://hdl.handle.net/20.500.12708/51851
• Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem / Leitner, M., Hu, B., & Raidl, G. (2007). Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem. In Proceedings of the International Network Optimization Conference 2007. International Network Optimization Conference, Spa, Belgien, EU. http://hdl.handle.net/20.500.12708/51927

2006

• Biased Mutation Operators for Subgraph-Selection Problems / Raidl, G., Koller, G., & Julstrom, B. (2006). Biased Mutation Operators for Subgraph-Selection Problems. IEEE Transactions on Evolutionary Computation, 10(2), 145–156. http://hdl.handle.net/20.500.12708/173461
• Cleaning of raw peptide ms/ms spectra: Improved protein identification following deconvolution of multiply charged peaks, isotope clusters, and removal of background noise. / Mujezinovic, N., Raidl, G., Hutchins, J. R. A., Peters, J. M., Mechtler, K., & Eisenhaber, F. (2006). Cleaning of raw peptide ms/ms spectra: Improved protein identification following deconvolution of multiply charged peaks, isotope clusters, and removal of background noise. Proteomics, VOL 6(19), 5117–5131. http://hdl.handle.net/20.500.12708/173460
• The core concept for the multidimensional knapsack problem. / Puchinger, J., Raidl, G., & Pferschy, U. (2006). The core concept for the multidimensional knapsack problem. In J. Gottlieb & G. Raidl (Eds.), Evolutionary Computation in Combinatorial Optimization - EvoCOP 2006, volume 3906 of LNCS (pp. 195–208). Springer. http://hdl.handle.net/20.500.12708/51759
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. / Puchinger, J., & Raidl, G. (2006). Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. (TR 186-1-06-02). http://hdl.handle.net/20.500.12708/33076
• Models and algorithms for three-stage two-dimensional bin packing. / Puchinger, J., & Raidl, G. (2006). Models and algorithms for three-stage two-dimensional bin packing. http://hdl.handle.net/20.500.12708/33040
• Two Integer Linear Programming Approaches for Solving the Car Sequencing Problem / Prandtstetter, M., & Raidl, G. (2006). Two Integer Linear Programming Approaches for Solving the Car Sequencing Problem. 10th International Workshop on Combinatorial Optimization, Aussois, Frankreich, EU. http://hdl.handle.net/20.500.12708/84604
• Large Neighborhoods in Variable Neighborhood Search Approaches for Generalized Network Design Problems / Hu, B., Leitner, M., & Raidl, G. (2006). Large Neighborhoods in Variable Neighborhood Search Approaches for Generalized Network Design Problems. 1st Workshop on Mathematical Contributions to Metaheuristics (Matheuristics 2006), Bertinoro, Italien, EU. http://hdl.handle.net/20.500.12708/84596
• Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem / Raidl, G., Hu, B., & Leitner, M. (2006). Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem. 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brasilien, Non-EU. http://hdl.handle.net/20.500.12708/84595
• Metaheuristics for Solving a Scheduling Problem in Car Manufacturing / Raidl, G. (2006). Metaheuristics for Solving a Scheduling Problem in Car Manufacturing. ICAM5 - Fifth International Conference on Applied Mathematics, Baia Mare, Rumänien, Non-EU. http://hdl.handle.net/20.500.12708/84597
• A unified view on hybrid metaheuristics. / Raidl, G. (2006). A unified view on hybrid metaheuristics. In F. Almeida (Ed.), Hybrid Metaheuristics - Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-14, 2006, Proceedings (pp. 1–12). Springer. http://hdl.handle.net/20.500.12708/51761
• Evolutionary approach to constrained minimum spanning tree problem. / Pagacz, A., Raidl, G., & Zawislak, S. (2006). Evolutionary approach to constrained minimum spanning tree problem. In J. Arabasa (Ed.), Evolutionary Computation and Global Optimization 2006, Murzasichle, Poland, 2006. (pp. 331–341). Oficyna Wydawnicza Politechniki Warszawskiej. http://hdl.handle.net/20.500.12708/51757
• Variable neighborhood descent with self-adaptive neighborhood-ordering. / Hu, B., & Raidl, G. (2006). Variable neighborhood descent with self-adaptive neighborhood-ordering. In C. Cotta, A. J. Fernandez, & J. E. Gallardo (Eds.), Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics. http://hdl.handle.net/20.500.12708/51756
• Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. / Gruber, M., van Hemert, J., & Raidl, G. (2006). Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. In M. Keijzer (Ed.), Proceedings of the Genetic and Evolutionary Computation Conference - GECCO 2006 (pp. 1187–1194). http://hdl.handle.net/20.500.12708/51755
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. / Hu, B., Leitner, M., & Raidl, G. (2006). Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. (Technical Report TR 186-1-06-01). http://hdl.handle.net/20.500.12708/33075
• Evolutionary Computation in Combinatorial Optimization - 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006. Proceedings. / Gottlieb, J., & Raidl, G. (Eds.). (2006). Evolutionary Computation in Combinatorial Optimization - 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006. Proceedings. Springer. http://hdl.handle.net/20.500.12708/22339

2005

• Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. / Raidl, G., & Gottlieb, J. (2005). Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. Evolutionary Computation, 13(4), 441–475. http://hdl.handle.net/20.500.12708/173365
• Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. / Puchinger, J., & Raidl, G. (2005). Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In J. Mira (Ed.), Artifical Intelligence and Knowledge Engineering Applications: A Bioinspired Approach (pp. 41–53). Springer. http://hdl.handle.net/20.500.12708/51231
• Relaxation guided variable neighborhood search. / Puchinger, J., & Raidl, G. (2005). Relaxation guided variable neighborhood search. In P. Hansen (Ed.), Proceedings of the XVIII Mini EURO Conference on VNS. http://hdl.handle.net/20.500.12708/51232
• Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem. / Puchinger, J., Raidl, G., & Gruber, M. (2005). Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem. In Proceedings of MIC2005, the 6th Metaheuristics International Conference. MIC2005 (The 6th Metaheuristics International Conference), Wien, Austria. http://hdl.handle.net/20.500.12708/51233
• A variable neihborhood search approach for solving the car sequencing problem. / Prandtstetter, M., & Raidl, G. (2005). A variable neihborhood search approach for solving the car sequencing problem. In P. Hansen (Ed.), Proceedings of the XVIII Mini EURO Conference on VNS. http://hdl.handle.net/20.500.12708/51230
• A variable neihborhood search approach for solving the car sequencing problem. / Prandtstetter, M., & Raidl, G. (2005). A variable neihborhood search approach for solving the car sequencing problem. http://hdl.handle.net/20.500.12708/33039
• Computing generalized minimum spanning trees with variable neighborhood search. / Hu, B., Leitner, M., & Raidl, G. (2005). Computing generalized minimum spanning trees with variable neighborhood search. In P. Hansen (Ed.), Proceedings of the XVIII Mini EURO Conference on VNS. http://hdl.handle.net/20.500.12708/51226
• Variable neighborhood search for the bounded diameter minimum spanning tree problem. / Gruber, M., & Raidl, G. (2005). Variable neighborhood search for the bounded diameter minimum spanning tree problem. In P. Hansen (Ed.), Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search. http://hdl.handle.net/20.500.12708/51225
• A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem. / Gruber, M., & Raidl, G. (2005). A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem. In Proceedings of the 2nd International Network Optimization Conference (pp. 178–185). http://hdl.handle.net/20.500.12708/51224
• GECCO: Genetic And Evolutionary Computation Conference Conference Proceedings / Beyer, H.-G., & Raidl, G. (Eds.). (2005). GECCO: Genetic And Evolutionary Computation Conference Conference Proceedings. ACM Press. http://hdl.handle.net/20.500.12708/22340
• Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings (LNCS 3448) / Raidl, G., & Gottlieb, J. (Eds.). (2005). Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings (LNCS 3448). Springer. http://hdl.handle.net/20.500.12708/22297

2004

• An evolutionary algorithm for the maximum weight trace formulation of the multiple sequence alignment problem. / Koller, G., & Raidl, G. (2004). An evolutionary algorithm for the maximum weight trace formulation of the multiple sequence alignment problem. In X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervós, J. A. Bullinaria, J. E. Rowe, P. Tiňo, A. Kabán, & H.-P. Schwefel (Eds.), Parallel Problem Solving from Nature - PPSN VIII (pp. 302–311). Springer. https://doi.org/10.1007/978-3-540-30217-9_31
• Models and algorithms for three-stage two-dimensional bin packing. / Puchinger, J., & Raidl, G. (2004). Models and algorithms for three-stage two-dimensional bin packing. http://hdl.handle.net/20.500.12708/33018
• Solving a real-world glass cutting problem / Puchinger, J., Raidl, G., & Koller, G. (2004). Solving a real-world glass cutting problem. EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal, Austria. http://hdl.handle.net/20.500.12708/84403
• An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem / Raidl, G. (2004). An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem. ACM Symposium on Applied Computing, Santa Fe, New Mexico, Austria. http://hdl.handle.net/20.500.12708/84428
• New ILP Approaches for 3-Staged Two-Dimensional Bin Packing / Raidl, G. (2004). New ILP Approaches for 3-Staged Two-Dimensional Bin Packing. EUROXX: 20th European Conference on Operational Research, Rhodos, Austria. http://hdl.handle.net/20.500.12708/84427
• An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem / Raidl, G. (2004). An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem. PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien, Austria. http://hdl.handle.net/20.500.12708/84426
• An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing / Raidl, G. (2004). An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien, Austria. http://hdl.handle.net/20.500.12708/84425
• Some Thoghts on How to Make Memetic Algorithms for Multiobjective Knapsack Problems / Raidl, G. (2004). Some Thoghts on How to Make Memetic Algorithms for Multiobjective Knapsack Problems. PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien, Austria. http://hdl.handle.net/20.500.12708/84424
• Hybrid Estimation of Distribution on Algorithm for Multiobjective Knapsack Problems / Raidl, G. (2004). Hybrid Estimation of Distribution on Algorithm for Multiobjective Knapsack Problems. EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal, Austria. http://hdl.handle.net/20.500.12708/84423
• Biased mutation operators for subgraph-selection problems. / Raidl, G., Koller, G., & Julstrom, B. (2004). Biased mutation operators for subgraph-selection problems. http://hdl.handle.net/20.500.12708/33016
• Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. / Raidl, G., & Gottlieb, J. (2004). Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. http://hdl.handle.net/20.500.12708/33017

2003

• Evolutionary Computation for Combinatorial Optimization / Raidl, G. (2003). Evolutionary Computation for Combinatorial Optimization. EvoNet Summer School 2003, University of Parma, Italy, Austria. http://hdl.handle.net/20.500.12708/84267
• On the Hybridization of Evolutionary Algorithms / Raidl, G. (2003). On the Hybridization of Evolutionary Algorithms. Genetic and Evolutionary Computation Conference (GECCO 2003), Chicago, IL, Austria. http://hdl.handle.net/20.500.12708/84265
• Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem / Raidl, G. (2003). Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem. Research Institute of Molecular Pathology, Biocenter Vienna, Wien, Austria. http://hdl.handle.net/20.500.12708/84266

 

2025

• Denoising Diffusion-Based Evolutionary Algorithms: Exploring Hybridizations of Evolutionary Algorithms with Denoising Diffusion Models / Salva, J. (2025). Denoising Diffusion-Based Evolutionary Algorithms: Exploring Hybridizations of Evolutionary Algorithms with Denoising Diffusion Models [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2025.126686
  Download: PDF (1.5 MB)
• Optimizing Elevator Control with a Destination Registration System / Kompauer, J. (2025). Optimizing Elevator Control with a Destination Registration System [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2025.114420
  Download: PDF (1.36 MB)

2024

• Strength estimation in the game of go / Neubauer, P. (2024). Strength estimation in the game of go [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.126103
  Download: PDF (48.4 MB)
• Graph neural networks meet local search for the weighted total domination problem / Simunics, A. (2024). Graph neural networks meet local search for the weighted total domination problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.108221
  Download: PDF (3.65 MB)
• An AlphaZero agent for just 4 fun, a non-deterministic game with imperfect information / Gastegger, M. (2024). An AlphaZero agent for just 4 fun, a non-deterministic game with imperfect information [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.115042
  Download: PDF (5.74 MB)

2023

• Advancing state space search for static and dynamic optimization by parallelization and learning / Frohner, N. (2023). Advancing state space search for static and dynamic optimization by parallelization and learning [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.113960
  Download: PDF (4.89 MB)
• Hybrid approaches to sports league scheduling using constraint programming and simulated annealing / Neumann, B. (2023). Hybrid approaches to sports league scheduling using constraint programming and simulated annealing [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.98488
  Download: PDF (1.39 MB)
• A learning multilevel optimization approach for a large location allocation problem / Tomandl, L. (2023). A learning multilevel optimization approach for a large location allocation problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.108220
  Download: PDF (2.52 MB)
• Computational optimization approaches for distributing battery exchange stations for electric scooters / Kreutzer, B. (2023). Computational optimization approaches for distributing battery exchange stations for electric scooters [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.106880
  Download: PDF (1.66 MB)
• Hybrid metaheuristics based on large neighborhood search and mixed integer linear programming for the directed feedback vertex set problem / Bresich, M. (2023). Hybrid metaheuristics based on large neighborhood search and mixed integer linear programming for the directed feedback vertex set problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.102404
  Download: PDF (1.66 MB)

2022

• Enhancing meta-agent conflict-based search for the multi-agent pathnding problem with informed merging and heuristics / Ederer, I. (2022). Enhancing meta-agent conflict-based search for the multi-agent pathnding problem with informed merging and heuristics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.98487
  Download: PDF (2.08 MB)
• Heuristic approaches for solving the interdependent lock scheduling problem / Schmidt, P. (2022). Heuristic approaches for solving the interdependent lock scheduling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.25760
  Download: PDF (3 MB)
• Using graph neural networks in local search for edge-based relaxations of the maximum clique problem / Ettrich, R. (2022). Using graph neural networks in local search for edge-based relaxations of the maximum clique problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.107601
  Download: PDF (1.73 MB)
• Optimization of container transportation for fixed-schedule block trains with optional round trips in collaborative logistics / Krasel, L. F. (2022). Optimization of container transportation for fixed-schedule block trains with optional round trips in collaborative logistics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99460
  Download: PDF (2.96 MB)
• Computational optimization approaches for distributing service points for mobility applications and smart charging of electric vehicles / Jatschka, T. (2022). Computational optimization approaches for distributing service points for mobility applications and smart charging of electric vehicles [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.107309
  Download: PDF (10.2 MB)
• Minimizing makespan in flow shops with a reinforcement learning like approach : A learning beam search for the no-wait flow shop scheduling problem with release times / Mayerhofer, J. (2022). Minimizing makespan in flow shops with a reinforcement learning like approach : A learning beam search for the no-wait flow shop scheduling problem with release times [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99461
  Download: PDF (4.84 MB)

2021

• Computational Methods for fleet scheduling in E-mobility / Varga, J. (2021). Computational Methods for fleet scheduling in E-mobility [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.87627
  Download: PDF (1.26 MB)
• A Matheuristic for battery exchange station location planning for electric scooters / Rauscher, M. (2021). A Matheuristic for battery exchange station location planning for electric scooters [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.94720
  Download: PDF (947 KB)
• Learning large neighborhood search for the staff resortering problem / Oberweger, F. F. (2021). Learning large neighborhood search for the staff resortering problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.92421
  Download: PDF (1.68 MB)
• Advances in search techniques for combinatorial optimization: New anytime A* search and decision diagram based approaches / Horn, M. (2021). Advances in search techniques for combinatorial optimization: New anytime A* search and decision diagram based approaches [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.96303
  Download: PDF (3.77 MB)
• Exact and heuristic approaches for solving string problems from bioinformatics / Djukanovic, M. (2021). Exact and heuristic approaches for solving string problems from bioinformatics [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.93203
  Download: PDF (5.06 MB)
• Scheduling the charging of electric vehicles with SOC-dependent maximum charging power / Schaden, B. (2021). Scheduling the charging of electric vehicles with SOC-dependent maximum charging power [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.87361
  Download: PDF (1.23 MB)
• Randomized construction approaches for the traveling tournament problem using lower bound based heuristics / Pace, G. (2021). Randomized construction approaches for the traveling tournament problem using lower bound based heuristics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.87881
  Download: PDF (1.37 MB)

2020

• Casual employee scheduling with constraint programming and metaheuristics / Teuschl, S. (2020). Casual employee scheduling with constraint programming and metaheuristics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.77621
  Download: PDF (920 KB)
• Solving a generalized constrained longest common subsequence problem : exact and heuristic methods / Berger, C. (2020). Solving a generalized constrained longest common subsequence problem : exact and heuristic methods [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.72420
  Download: PDF (756 KB)
• Heuristic optimization methods for seasonal airport slot allocation / Kuran, S. J. (2020). Heuristic optimization methods for seasonal airport slot allocation [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.37426
  Download: PDF (2.82 MB)

2019

• Combinatorial optimization approaches for graph construction problems / Klocker, B. (2019). Combinatorial optimization approaches for graph construction problems [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.76220
  Download: PDF (1.49 MB)
• A Variable neighborhood search for the job sequencing with one common and multiple secondary resources problem / Kaufmann, T. (2019). A Variable neighborhood search for the job sequencing with one common and multiple secondary resources problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.59930
  Download: PDF (5.46 MB)
• Perfect pseudo matchings on snarks / Schwendinger, B. (2019). Perfect pseudo matchings on snarks [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.60527
  Download: PDF (702 KB)
• Solving a weighted set covering problem for improving algorithms for cutting stock problems with setup costs by solution merging / Klocker, B. (2019). Solving a weighted set covering problem for improving algorithms for cutting stock problems with setup costs by solution merging [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.64801
  Download: PDF (1.78 MB)
• Algorithmic approaches for Optimization problems in bike sharing and security control / Kloimüllner, C. (2019). Algorithmic approaches for Optimization problems in bike sharing and security control [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.25373
  Download: PDF (3.58 MB)
• A Heuristic approach to aircraft trajectory optimization with constraints / Windbichler, A. (2019). A Heuristic approach to aircraft trajectory optimization with constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.59020
  Download: PDF (3.76 MB)
• Patient scheduling in particle therapy / Maschler, J. (2019). Patient scheduling in particle therapy [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.64848
  Download: PDF (2.54 MB)
• Automatisierte Berechnung optimaler Einstellungsparameter myoelektrischer Handprothesen / Gerger, S. (2019). Automatisierte Berechnung optimaler Einstellungsparameter myoelektrischer Handprothesen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79386

2018

• Methods for intraday scheduling in particle therapy / Höfler, M. (2018). Methods for intraday scheduling in particle therapy [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.42364
  Download: PDF (2.97 MB)
• Parallel hybrid metaheuristics for solving the firefighter problem using the GPU / Gajic, G. (2018). Parallel hybrid metaheuristics for solving the firefighter problem using the GPU [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.50524
  Download: PDF (2.84 MB)
• Advances in decomposition approaches for mixed Integer linear programming / Riedler, M. (2018). Advances in decomposition approaches for mixed Integer linear programming [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.60465
  Download: PDF (1.94 MB)
• Local search methods for the particle therapy patient scheduling problem / Hackl, T. (2018). Local search methods for the particle therapy patient scheduling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.45164
  Download: PDF (827 KB)
• Monero cross-chain traceability : empirical analysis of privacy implications from currency hard-forks / Hinteregger, A. (2018). Monero cross-chain traceability : empirical analysis of privacy implications from currency hard-forks [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.57770
  Download: PDF (842 KB)

2017

• An iterative time-bucket refinement algorithm for high resolution scheduling problems / Jatschka, T. (2017). An iterative time-bucket refinement algorithm for high resolution scheduling problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.45162
  Download: PDF (900 KB)
• A heuristic framework for dynamic vehicle routing with site-dependent constraints / Horn, M. (2017). A heuristic framework for dynamic vehicle routing with site-dependent constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.37527
  Download: PDF (849 KB)

2016

• A hybrid evolutionary algorithm for the vehicle routing problem with stochastic demands / Pourmanouchehri, S. (2016). A hybrid evolutionary algorithm for the vehicle routing problem with stochastic demands [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.27924
  Download: PDF (8.71 MB)
• Metaheuristics for the districting and routing problem for security control / Prischink, M. (2016). Metaheuristics for the districting and routing problem for security control [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.35903
  Download: PDF (805 KB)
• Complete solution archives for evolutionary combinatorial optimization : application to a competitive location and a stochastic vehicle routing problem / Biesinger, B. (2016). Complete solution archives for evolutionary combinatorial optimization : application to a competitive location and a stochastic vehicle routing problem [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.36672
  Download: PDF (4.69 MB)
• Visibility-based obstacle placing : automated obstacle placing based on circularity / Schwab, C. (2016). Visibility-based obstacle placing : automated obstacle placing based on circularity [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.24629
  Download: PDF (3.24 MB)
• Column generation at strip level for the K-staged two-dimensional Cutting Stock Problem / Leberl, F. (2016). Column generation at strip level for the K-staged two-dimensional Cutting Stock Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.27981
  Download: PDF (897 KB)

2015

• Solving the multi-objective Steiner Tree problem with resources / Brandstätter, G. (2015). Solving the multi-objective Steiner Tree problem with resources [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.23734
  Download: PDF (673 KB)
• Solving the travelling thief problem with an evolutionary algorithm / Wachter, C. (2015). Solving the travelling thief problem with an evolutionary algorithm [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.27702
  Download: PDF (1.11 MB)
• A branch-and-bound approach for the constrained K-staged 2-dimensional cutting stock problem / Bonigl, B. (2015). A branch-and-bound approach for the constrained K-staged 2-dimensional cutting stock problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.31767
  Download: PDF (697 KB)
• Electric vehicles recharge scheduling with logic-based Benders decomposition / Ölsböck, K. (2015). Electric vehicles recharge scheduling with logic-based Benders decomposition [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.26531
  Download: PDF (786 KB)
• Optimierungsansätze zur Planung von Freizeit-Fahrradrouten / Klocker, B. (2015). Optimierungsansätze zur Planung von Freizeit-Fahrradrouten [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/158764

2014

• Applying Ant Colony Optimization to the Periodic Vehicle Routing Problem with Time Windows / Trummer, D. (2014). Applying Ant Colony Optimization to the Periodic Vehicle Routing Problem with Time Windows [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.23986
  Download: PDF (4.08 MB)
• Heuristic solution approaches for the two dimensional pre-marshalling problem / Tus, A. (2014). Heuristic solution approaches for the two dimensional pre-marshalling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.24992
  Download: PDF (806 KB)
• Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework / Klaffenböck, P. H. W. (2014). Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.23963
  Download: PDF (1010 KB)
• Finding longest common subsequences by GPU-based parallel Ant Colony Optimization / Markvica, D. (2014). Finding longest common subsequences by GPU-based parallel Ant Colony Optimization [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159087

2013

• Optimization challenges of the future federated internet : heuristic and exact approaches / Inführ, J. (2013). Optimization challenges of the future federated internet : heuristic and exact approaches [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21654
  Download: PDF (2.3 MB)
• Metaheuristics for the regenerator location problem / Jahrmann, P. (2013). Metaheuristics for the regenerator location problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-46305
  Download: PDF (787 KB)
• A hybrid algorithm for the Partition Coloring Problem / Fritz, G. (2013). A hybrid algorithm for the Partition Coloring Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.22460
  Download: PDF (1.07 MB)
• Balancing bike sharing systems : a hybrid metaheuristic approach for the dynamic case / Pinter, A. (2013). Balancing bike sharing systems : a hybrid metaheuristic approach for the dynamic case [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.23274
  Download: PDF (1.22 MB)
• Two-phase local search for the bi-objective connected facility location problem / Petelin, T. (2013). Two-phase local search for the bi-objective connected facility location problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.22949
  Download: PDF (2.8 MB)
• The rooted delay-constrained Steiner tree problem with uncertain delays / Karl, R. (2013). The rooted delay-constrained Steiner tree problem with uncertain delays [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21652
  Download: PDF (646 KB)
• Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems / Putzenlechner, M. (2013). Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21802
  Download: PDF (2.8 MB)
• Metaheuristic optimization of electro-hybrid powertrains using machine learning techniques / Bacher, C. (2013). Metaheuristic optimization of electro-hybrid powertrains using machine learning techniques [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21840
  Download: PDF (4.16 MB)
• Critical links detection using CUDA / Schnabl, T. (2013). Critical links detection using CUDA [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159715
• Selective graph coloring problem / Volko, C.-D. (2013). Selective graph coloring problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159739

2012

• The Vehicle Routing Problem with Compartments : exact and metaheuristic approaches / Gebhard, P. (2012). The Vehicle Routing Problem with Compartments : exact and metaheuristic approaches [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-56025
  Download: PDF (1.39 MB)
• Improving the protein identification performance in high-resolution mass spectrometry data / Dusberger, F. (2012). Improving the protein identification performance in high-resolution mass spectrometry data [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-59974
  Download: PDF (6.04 MB)
• Enhancing an evolutionary algorithm with a solution archive to reconstruct cross cut shredded text documents / Biesinger, B. (2012). Enhancing an evolutionary algorithm with a solution archive to reconstruct cross cut shredded text documents [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-59288
  Download: PDF (2.68 MB)
• Hybrid metaheuristics and matheuristics for problems in bioinformatics and transportation / Pirkwieser, S. (2012). Hybrid metaheuristics and matheuristics for problems in bioinformatics and transportation [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-55573
  Download: PDF (1.99 MB)
• On solving constrained tree problems and an adaptive layers framework / Ruthmair, M. (2012). On solving constrained tree problems and an adaptive layers framework [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-54456
  Download: PDF (1.19 MB)
• Metaheuristics for a multimodal home-healthcare scheduling problem / Hiermann, G. (2012). Metaheuristics for a multimodal home-healthcare scheduling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/161084
• Solving multimodal resource constrained project scheduling problems / Sturm, M. (2012). Solving multimodal resource constrained project scheduling problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160599
• Extending the Gecode framework with interval constraint programming / Ivezić, I. (2012). Extending the Gecode framework with interval constraint programming [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160590

2011

• Solving the k-node minimum label spanning arborescence problem with exact and heuristic methods / Oberlechner, K. (2011). Solving the k-node minimum label spanning arborescence problem with exact and heuristic methods [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-45697
  Download: PDF (573 KB)
• Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten / Winkler, T. (2011). Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-38069
  Download: PDF (3.13 MB)
• Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus / Krenek, T. (2011). Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-38051
  Download: PDF (1.16 MB)
• A Multilevel Refinement approach to the Rooted Delay-Constrained Steiner Tree Problem / Seidl, T. (2011). A Multilevel Refinement approach to the Rooted Delay-Constrained Steiner Tree Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-41486
  Download: PDF (488 KB)
• Clustering heuristics for the hierarchical ring network problem / Schuster, R. (2011). Clustering heuristics for the hierarchical ring network problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-58321
  Download: PDF (445 KB)
• Heuristic methods for the Hop Constrained Survivable Network Design Problem / Fritz, G. (2011). Heuristic methods for the Hop Constrained Survivable Network Design Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160799
• Image denoising with variational methods via graph cuts / Lang, L. (2011). Image denoising with variational methods via graph cuts [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/161500
• Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem / Gruber, C. (2011). Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160798
• Branch-and-price for the Steiner tree problem with revenues, budget and hop constraints / Sinnl, M. (2011). Branch-and-price for the Steiner tree problem with revenues, budget and hop constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160792
• Optimierung der periodischen Tourenplanung in der Müllentsorgung / Edlinger, K.-M. (2011). Optimierung der periodischen Tourenplanung in der Müllentsorgung [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160202

2010

• Reconstructing cross-cut shredded documents by means of evolutionary algorithms / Schauer, C. (2010). Reconstructing cross-cut shredded documents by means of evolutionary algorithms [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-36198
  Download: PDF (4.97 MB)
• Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem / Berlakovich, M. (2010). Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-43399
  Download: PDF (1.01 MB)
• On the minimum label spanning tree problem : solution methods and applications / Chwatal, A. M. (2010). On the minimum label spanning tree problem : solution methods and applications [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-30618
  Download: PDF (927 KB)
• Solving two network design problems by mixed integer programming and hybrid optimization methods / Leitner, M. (2010). Solving two network design problems by mixed integer programming and hybrid optimization methods [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-36359
  Download: PDF (772 KB)
• Heuristic methods for solving two Generalized Network Problems / Pagacz, A. (2010). Heuristic methods for solving two Generalized Network Problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-35977
  Download: PDF (942 KB)
• Compressing fingerprint templates by solving the k-node minimum label spanning arborescence problem by branch-and-price / Thöni, C. (2010). Compressing fingerprint templates by solving the k-node minimum label spanning arborescence problem by branch-and-price [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-35773
  Download: PDF (1.71 MB)
• Automatic generation of 2-AntWars players with genetic programming / Inführ, J. (2010). Automatic generation of 2-AntWars players with genetic programming [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-39519
  Download: PDF (65 MB)
• Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem / Sonnleitner, M. (2010). Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/161374
• A timeslot-based heuristic approach to construct high-school timetables / Pimmer, M. (2010). A timeslot-based heuristic approach to construct high-school timetables [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160861

2009

• Enhancing a genetic algorithm by a complete solution archive based on a trie data structure / Šramko, A. (2009). Enhancing a genetic algorithm by a complete solution archive based on a trie data structure [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-27056
  Download: PDF (1.63 MB)
• Hybrid optimization methods for warehouse logistics and the reconstruction of destroyed paper documents / Prandtstetter, M. (2009). Hybrid optimization methods for warehouse logistics and the reconstruction of destroyed paper documents [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-32849
  Download: PDF (3.36 MB)
• Exact and heuristic approaches for solving the bounded diameter minimum spanning tree problem / Gruber, M. (2009). Exact and heuristic approaches for solving the bounded diameter minimum spanning tree problem [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-24552
  Download: PDF (1.22 MB)
• Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenfindung in einem Ersatzteillager mit domänenspezifschen Nebenbedingungen / Misar, T. (2009). Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenfindung in einem Ersatzteillager mit domänenspezifschen Nebenbedingungen [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-26098
  Download: PDF (563 KB)
• Ein Lösungsarchiv-unterstützter evolutionärer Algorithmus für das GMST-Problem / Wolf, M. (2009). Ein Lösungsarchiv-unterstützter evolutionärer Algorithmus für das GMST-Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186093
• Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing / Walla, J. (2009). Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186033
• Similarity searching in complex business events and sequences thereof / Obweger, H. (2009). Similarity searching in complex business events and sequences thereof [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185664
• Event-based similarity search and its applications in business analytics / Suntinger, M. (2009). Event-based similarity search and its applications in business analytics [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185660

2008

• Evaluation and reconstruction of strip-shredded text documents / Morandell, W. (2008). Evaluation and reconstruction of strip-shredded text documents [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-26233
  Download: PDF (1.8 MB)
• Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie mit kundenspezifischen Auslagerpräferenzen / Ritzinger, U. M. (2008). Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie mit kundenspezifischen Auslagerpräferenzen [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-29245
  Download: PDF (7.67 MB)
• Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung / Musil, N. (2008). Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-22850
  Download: PDF (883 KB)
• Parallel Variable Neighbourhood Search for the Car Sequencing Problem / Knausz, M. (2008). Parallel Variable Neighbourhood Search for the Car Sequencing Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-24045
  Download: PDF (621 KB)
• Hybrid metaheuristics for generalized network design problems / Hu, B. (2008). Hybrid metaheuristics for generalized network design problems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-24387
  Download: PDF (676 KB)
• Reconstructing borders of manually torn paper sheets using integer linear programming / Schüller, P. (2008). Reconstructing borders of manually torn paper sheets using integer linear programming [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-15999
  Download: PDF (841 KB)
• Combinatorial optimization for the compression of biometric templates / Dietzel, O. (2008). Combinatorial optimization for the compression of biometric templates [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-22579
  Download: PDF (2.63 MB)
• An incremental Dynamic Programming Approach for multidimensional allocation problems / Bonitz, C. (2008). An incremental Dynamic Programming Approach for multidimensional allocation problems [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183777
• Lagrangian relax-and-cut and hybrid methods for the bounded diameter and the hop constrained minimum spanning tree problems / Zaubzer, F. (2008). Lagrangian relax-and-cut and hybrid methods for the bounded diameter and the hop constrained minimum spanning tree problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183762
• A complete archive genetic algorithm for the Multidimensional Knapsack Problem / Zaubzer, S. (2008). A complete archive genetic algorithm for the Multidimensional Knapsack Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183761
• Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen / Berger, F. (2008). Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179753
• Webbasierte Darstellung großer Datenmengen als Pivot-Tabelle mithilfe ressourcenoptimierter Aggregationsverfahren / Potocka, A. K. (2008). Webbasierte Darstellung großer Datenmengen als Pivot-Tabelle mithilfe ressourcenoptimierter Aggregationsverfahren [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179722

2007

• Algorithmic approaches to the string barcoding problem / Neuner, P. (2007). Algorithmic approaches to the string barcoding problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-16487
  Download: PDF (832 KB)
• Metaheuristic approaches for designing survivable fiber-optic networks / Bucsics, T. (2007). Metaheuristic approaches for designing survivable fiber-optic networks [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-32479
  Download: PDF (657 KB)
• Improved protein identification after fast elimination of non-interpretable peptide MS/MS spectra and noise reduction / Mujezinovic, N. (2007). Improved protein identification after fast elimination of non-interpretable peptide MS/MS spectra and noise reduction [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-18901
  Download: PDF (2.76 MB)
• Subgradient optimization based Lagrangian relaxation and relax-and-cut approaches for the bounded-diameter minimum spanning tree problem / Putz, P. (2007). Subgradient optimization based Lagrangian relaxation and relax-and-cut approaches for the bounded-diameter minimum spanning tree problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184168
• Map-Matching und Wegsuche in einem geografischen Informationssystem / Braumann, A. (2007). Map-Matching und Wegsuche in einem geografischen Informationssystem [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181909

2006

• A Lagrangian decomposition approach combined with metaheuristics for the Knapsack Constrained Maximum Spanning Tree problem / Pirkwieser, S. (2006). A Lagrangian decomposition approach combined with metaheuristics for the Knapsack Constrained Maximum Spanning Tree problem [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-34434
  Download: PDF (1.03 MB)
• An ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem / Kopinitsch, B. (2006). An ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-25663
  Download: PDF (440 KB)
• Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen / Chwatal, A. M. (2006). Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185520
• Solving two generalized network design problems with exact and heuristic methods / Leitner, M. (2006). Solving two generalized network design problems with exact and heuristic methods [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185040
• Cluster planarity testing for the case of not necessarily connected clusters / Beibl, R. (2006). Cluster planarity testing for the case of not necessarily connected clusters [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/178002

2005

• Combining metaheuristics and integer programming for solving cutting and packing problems / Puchinger, J. (2005). Combining metaheuristics and integer programming for solving cutting and packing problems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-21487
  Download: PDF (764 KB)
• An extended local branching framework and its application to the multidimensional Knapsack problem / Lichtenberger, D. (2005). An extended local branching framework and its application to the multidimensional Knapsack problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184602
• Option pricing by means of genetic programming / Heigl, A. (2005). Option pricing by means of genetic programming [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184545
• An application of the Dijkstra's algorithm for a (on-board) route (re-) planning module / Verlut, G. (2005). An application of the Dijkstra’s algorithm for a (on-board) route (re-) planning module [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/182706
• Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem / Wagner, D. (2005). Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179893
• Exact and heuristic methods for solving the car sequencing problem / Prandtstetter, M. (2005). Exact and heuristic methods for solving the car sequencing problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179890
• Multiple structural RNA alignment with affine gap costs based on Lagrangian relaxation / Gamper, V. (2005). Multiple structural RNA alignment with affine gap costs based on Lagrangian relaxation [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179889

2004

• An alignment graph based evolutionary algorithm for the multiple sequence alignment problem / Leopold, S. (2004). An alignment graph based evolutionary algorithm for the multiple sequence alignment problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184100
• Ein genetischer Algorithmus für das Optimum Communication Spanning Tree Problem / Gruber, G. (2004). Ein genetischer Algorithmus für das Optimum Communication Spanning Tree Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/182575

2003

• Evolutionäre Algorithmen für das kapazitätsbeschränkte minimale Spannbaumproblem / Braun, J. (2003). Evolutionäre Algorithmen für das kapazitätsbeschränkte minimale Spannbaumproblem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185824
• Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems / Kersting, S. A. (2003). Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183449
• Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem / Fauster, J. (2003). Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183024
• Ein genetischer Algorithmus für das Generalized Assignment Problem / Feltl, H. (2003). Ein genetischer Algorithmus für das Generalized Assignment Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183022

2002

• Ein effizienter hybrider evolutionärer Algorithmus für kapazitätenbeschränkte minimale Spannbaumprobleme / Bleyer, M. (2002). Ein effizienter hybrider evolutionärer Algorithmus für kapazitätenbeschränkte minimale Spannbaumprobleme [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181291

2001

• Ant Colony Optimization für Entwurf und Optimierung von Netzwerkstrukturen / Fauster, W. (2001). Ant Colony Optimization für Entwurf und Optimierung von Netzwerkstrukturen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/182450

 

• Marie-Curie Research Training Network: Algorithmic Descrete Optimization Network (ADONET) - Austrian Coordinator
  2004 / EC Europäische Komission - Marie Curie / Website / Project

Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.

Until then, please visit Günther Raidl’s research profile in TISS .