2021W

• Algorithmics / 186.814 / VU
• Bachelor Thesis in Computer Science / 186.819 / PR
• Heuristic Optimization Techniques / 186.112 / VU
• Metaheuristics and Hybrid Methods for Combinatorial Optimization / 186.860 / VU
• Project in Computer Science 1 / 186.820 / PR
• Project in Computer Science 2 / 186.821 / PR
• Project in CS1: Team-Based Research in Algorithmics / 192.105 / PR
• Project in Software Engineering & Internet Computing / 186.852 / 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 PhD candidates / 186.199 / SE

2022S

• Algorithms and Data Structures / 186.866 / VU
• Bachelor Thesis in Computer Science / 186.819 / PR
• Metaheuristics and Hybrid Methods for Combinatorial Optimization / 186.860 / VU
• Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
• Project in Computer Science 1 / 186.820 / PR
• Project in Computer Science 2 / 186.821 / 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

• Cooperative Personnel Scheduling
  2022 – 2026 / Honda Research Institute Europe Gmb
• 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
• Doktoratskolleg "Vienna Graduate School on Computational Optimization"
  2016 – 2024 / Austrian Science Fund (FWF)
• 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)
• Multi-Criteria Optimization of FTTx Networks
  2012 – 2013 / Austrian Science Fund (FWF)
• Balancing Bike-Sharing Systems
  2011 – 2016 / Austrian Research Promotion Agency (FFG)
• Optimization Challenges in the Operation of the Future, Federated Internet
  2010 – 2014 / Vienna Science and Technology Fund (WWFT)
• 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)

2021

• Driver Shift Planning for an Online Store with Short Delivery Times / M. Horn, N. Frohner, G. Raidl / Talk: International Conference on Industry 4.0 and Smart Manufacturing, virtual event; 2021-11-17 - 2021-11-19; in: "Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing", Elsevier, 180 (2021), ISSN: 1877-0509; 517 - 524
• A∗-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem / M. Horn, G. Raidl / Talk: CPAIOR 2021 - 18th International Conference of Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Wien; 2021-07-05 - 2021-07-08; in: "International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research", LNCS / Springer, 12735 (2021), ISBN: 978-3-030-78229-0; 72 - 88
• Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems / A. Bracher, N. Frohner, G. Raidl / Talk: CPAIOR 2021 - 18th International Conference of Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Wien; 2021-07-05 - 2021-07-08; in: "Integration of Constraint Programming, Artificial Intelligence, and Operations Research", LNCS / Springer, 12735 (2021), ISBN: 978-3-030-78229-0; 283 - 298
• Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings / B. Nikolic, A. Kartelj, M. Djukanovic, M. Grbic, C. Blum, G. Raidl / Mathematics, 9 (2021), 1 - 25
• Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources / J. Maschler, G. Raidl / Annals of Operations Research, 302 (2021), 507 - 531

2020

• Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines / N. Frohner, M. Horn, G. Raidl / Talk: International Conference on Industry 4.0 and Smart Manufacturing, virtual event; 2020-11-23 - 2020-11-25; in: "Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020)", Elsevier, 180 (2020), ISSN: 1877-0509; 366 - 370
• On Solving a Generalized Constrained Longest Common Subsequence Problem / M. Djukanovic, C. Berger, G. Raidl, C. Blum / Talk: International Conference on Optimization and Applications, Moscow, Russia; 2020-09-28 - 2020-10-02; in: "International Conference on Optimization and Applications-OPTIMA2020", LNCS / Springer, 12422 (2020), ISBN: 978-3-030-62866-6; 55 - 70
• On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences / M. Horn, M. Djukanovic, C. Blum, G. Raidl / Talk: International Conference Optimization and Applications, Moscow, Russia; 2020-09-28 - 2020-10-02; in: "Optimization and Applications", LNCS / Springer, 12422 (2020), ISBN: 978-3-030-62866-6; 134 - 149
• Distributing Battery Swapping Stations for Electric Scooters in an Urban Area / T. Jatschka, T. Rodemann, G. Raidl / Talk: International Conference Optimization and Applications, Moscow, Russia; 2020-09-28 - 2020-10-02; in: "Optimization and Applications", LNCS / Springer, 12422 (2020), ISBN: 978-3-030-62867-3; 150 - 165
• On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences / M. Horn, M. Djukanovic, C. Blum, G. Raidl / Talk: CPAIOR 2020, Wien; 2020-09-21 - 2020-09-24
• A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem / Th. Kaufmann, M. Horn, G. Raidl / Talk: International Conference on Parallel Problem Solving From Nature (PPSN), Leiden, The Netherlands; 2020-09-05 - 2020-09-09; in: "Parallel Problem Solving from Nature - PPSN XVI", LNCS / Springer, 12270 (2020), ISBN: 978-3-030-58115-2; 385 - 398
• A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility / N. Frohner, G. Raidl / Talk: International Conference of the Practice and Theory of Automated Timetabling (PATAT), Bruges, Belgium; 2020-08-25 - 2020-08-29; in: "Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling", (2020), ISBN: 978-0-9929984-3-1; 58 - 76
• A Beam Search Approach to the Traveling Tournament Problem / N. Frohner, B. Neumann, G. Raidl / Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Sevilla, Spain; 2020-04-15 - 2020-04-17; in: "EvoCOP 2020: Evolutionary Computation in Combinatorial Optimization", LNCS, 12102 (2020), ISBN: 978-3-030-43680-3; 67 - 82
• A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three / B. Klocker, H. Fleischner, G. Raidl / Applied Mathematics and Computation, 380 (2020), 1 - 19
• A*-based construction of decision diagrams for a prize-collecting scheduling problem / M. Horn, J. Maschler, G. Raidl, E. Rönnberg / Computers & Operations Research, 126 (2020), 1 - 21
• A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources / M. Horn, G. Raidl, E. Rönnberg / Annals of Operations Research, 82 (2020), 1 - 29
• Finding Longest Common Subsequences: New anytime A search results / M. Djukanovic, G. Raidl, C. Blum / Applied Soft Computing, 95 (2020), 1 - 21
• An A∗Search Algorithm for the Constrained Longest Common Subsequence Problem / M. Djukanovic, C. Berger, G. Raidl, C. Blum / Information Processing Letters, 166 (2020), 1 - 10
• A model for finding transition-minors / B. Klocker, H. Fleischner, G. Raidl / Discrete Applied Mathematics, 283 (2020), 242 - 264
• Anytime algorithms for the longest common palindromic subsequence problem / M. Djukanovic, G. Raidl, C. Blum / Computers & Operations Research, 114 (2020), 20 pages
• Solving longest common subsequence problems via a transformation to the maximum clique problem / C. Blum, M. Djukanovic, A. Santini, H. Jiang, C. Li, F. Manya, G. Raidl / Computers & Operations Research, 125 (2020), 17 pages

2019

• A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem / C. Blum, D. Thiruvady, A. Ernst, M. Horn, G. Raidl / Talk: Advances in Artificial Intelligence, North Terrace, Adelaide, South Australia; 2019-12-02 - 2019-12-05; in: "AI 2019: Advances in Artificial Intelligence", LNCS, 11919 (2019), ISBN: 978-3-030-35288-2; 549 - 560
• Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers / N. Frohner, G. Raidl / Talk: International Conference on Machine Learning, Optimization, and Data Science, Siena, Italy; 2019-09-10 - 2019-09-13; in: "Machine Learning, Optimization, and Data Science", LNCS, 11943 (2020), ISBN: 978-3-030-37599-7; 445 - 457
• A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation / M. Djukanovic, G. Raidl, C. Blum / Talk: International Conference on Machine Learning, Optimization, and Data Science, Certosa di Pontignano, Siena, Italy; 2019-09-10 - 2019-09-13; in: "Machine Learning, Optimization, and Data Science", LNCS, 11943 (2020), ISBN: 978-3-030-37598-0; 154 - 167
• Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications / T. Jatschka, T. Rodemann, G. Raidl / Talk: International Conference on Machine Learning, Optimization, and Data Science, Certosa di Pontignano, Siena, Italy; 2019-09-10 - 2019-09-13; in: "Machine Learning, Optimization, and Data Science", Lecture Notes in Computer Science, 11943 (2019), ISBN: 978-3-030-37599-7; 738 - 750
• Towards Improving Merging Heuristicsfor Binary Decision Diagrams / N. Frohner, G. Raidl / Talk: Learning and Intelligent OptimizatioN Conference LION, Chania, Greece; 2019-05-27 - 2019-05-31; in: "LION 2019: Learning and Intelligent Optimization", LNCS, 11968 (2020), ISBN: 978-3-030-38628-3; 30 - 45
• A SAT Approach for Finding Sup-Transition-Minors / B. Klocker, H. Fleischner, G. Raidl / Talk: Learning and Intelligent OptimizatioN Conference LION, Chania, Crete, Greece; 2019-05-27 - 2019-05-31; in: "Learning and Intelligent Optimization", LNCS, 11968 (2019), ISBN: 978-3-030-38628-3; 325 - 341
• A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications / T. Jatschka, T. Rodemann, G. Raidl / Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Leipzig, Germany; 2019-04-24 - 2019-04-26; in: "Evolutionary Computation in Combinatorial Optimization 2019", Lecture Notes in Computer Science, 11452 (2019), ISBN: 978-3-030-16711-0; 1 - 16
• VNS and PBIG as Optimization Cores in aCooperative Optimization Approach forDistributing Service Points / T. Jatschka, T. Rodemann, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), lLas Palmas de Gran Canaria, Spain; 2019-02-17 - 2019-02-22; in: "Computer Aided Systems Theory - EUROCAST 2019", LNCS, 12013 (2020), ISBN: 978-3-030-45092-2; 255 - 262
• Casual Employee Scheduling with Constraint Programming and Metaheuristics / N. Frohner, S. Teuschl, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Las Palmas de Gran Canaria, Spain; 2019-02-17 - 2019-02-22; in: "EUROCAST 2019: Computer Aided Systems Theory - EUROCAST 2019", LNCS, 12013 (2019), ISBN: 978-3-030-45092-2; 279 - 287
• Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem / M. Horn, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Las Palmas de Gran Canaria, Spain; 2019-02-17 - 2019-02-22; in: "Computer Aided System Theory - EUROCAST 2019", (2019), ISBN: 978-84-09-09208-6; 94 - 95
• VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points / T. Jatschka, T. Rodemann, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Las Palmas de Gran Canaria, Spain; 2019-02-17 - 2019-02-22; in: "EXTENDED ABSTRACTS-Computer Aided Systems Theory 2019", IUCTC Universidad de Las Palmas de Gran Canaria, (2019), ISBN: 978-84-09-09208-6; 70 - 71
• A Heuristic Approach for Solving the Longest Common Square Subsequence Problem / M. Djukanovic, G. Raidl, C. Blum / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Las Palmas de Gran Canaria, Spain; 2019-02-17 - 2019-02-22; in: "EXTENDED ABSTRACTS-Computer Aided Systems Theory 2019", IUCTC Universidad de Las Palmas de Gran Canaria, (2019), ISBN: 978-84-09-09208-6; 120 - 122
• Strategies for Iteratively Refining Layered Graph Models / M. Riedler, M. Ruthmair, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Concepcion, Chile; 2019-01-16 - 2019-01-18; in: "Hybrid Metaheuristics: 11th International Workshop", Lecture Notes in Computer Science, 11299 (2019), ISBN: 978-3-030-05982-8; 46 - 62
• A Memetic Algorithm for Competitive Facility Location Problems / B. Biesinger, B. Hu, G. Raidl / in: "Business and Consumer Analytics: New Ideas", Springer, 2019, ISBN: 978-3-030-06221-7, 637 - 660
• Metaheuristic Hybrids / G. Raidl, J. Puchinger, C. Blum / in: "Handbook of Metaheuristics", issued by: Michel Gendreau, Jean Yves Potvin, eds.; Springer, 2019, ISBN: 978-3-319-91085-7, 385 - 417
• Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm / M. Horn, G. Raidl, C. Blum / Artificial Intelligence, 277 (2019), 1 - 26
• Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization / N. Frohner, S. Teuschl, G. Raidl / in: "Eurocast2019-EXTENDED ABSTRACTS", Universidad de Las Palmas de Gran Canaria, 2019, ISBN: 978-84-09-09208-6, 78 - 79

2018

• Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem / J. Maschler, G. Raidl / Talk: Patat2018, Wien; 2018-08-28 - 2018-08-31; in: "PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling}", (2018), 375 - 397
• Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments / J. Maschler, M. Riedler, G. Raidl / in: "Computer Aided Systems Theory - EUROCAST 2017", issued by: Springer Verlag; Springer, 2018, ISBN: 978-3-319-74717-0, 364 - 372
• Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging / B. Klocker, G. Raidl / in: "Computer Aided Systems Theory -- EUROCAST 201", 10671; issued by: Springer; Springer LNCS, 2018, ISBN: 978-3-319-74727-9, 355 - 363
• An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows / M. Horn, G. Raidl, E. Rönnberg / in: "Annals of Operations Research", 10479; Springer, 2018, 235 - 256
• GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection / A. Expósito, G. Raidl, J. Brito, J. Moreno-Perez / in: "Computer Aided Systems Theory", 10671; issued by: Springer Verlag; Springer LNCS, 2018, 299 - 306
• Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments / J. Maschler, G. Raidl / Journal of Graph Theory, 96 (2018)

2017

• Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment / M. Horn, G. Raidl, C. Blum / Talk: International Workshop on Machine Learning, Optimization, and Big Data, Volterra, Italy; 2017-09-14 - 2017-09-17; in: "MOD 2017: Machine Learning, Optimization, and Big Data - Third International Conference", LNCS, 10710 (2017), ISBN: 978-3-319-72925-1; 506 - 518
• Mixed Integer Programming Approaches for Resource-Constrained Project Scheduling / G. Raidl / Talk: University of Vienna, Department of Statistics and Operations Research, University of Vienna, Department of Statistics and Operations Research (invited); 2017-07-06
• An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem / J. Maschler, T. Hackl, M. Riedler, G. Raidl / Talk: Metaheuristics: Proceeding of the MIC and MAEB 2017 Conferences, Metaheuristics: Proceeding of the MIC and MAEB 2017 Conferences; 2017-07-04 - 2017-07-07; in: "http://mic2017.upf.edu/proceedings/", (2017), 463 - 472
• Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem / C. Kloimüllner, G. Raidl / Talk: Conference Proceedings of Learning and Intelligent Optimization Conference, onference Proceedings of Learning and Intelligent Optimization Conference; 2017-06-19 - 2017-06-21; in: "Conference Proceedings of Learning and Intelligent Optimization Conference", (2017), ISBN: 978-3-319-69404-7; 1 - 16
• Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control / C. Kloimüllner, G. Raidl / Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Amsterdam; 2017-04-19 - 2017-04-21; in: "Evolutionary Computation in Combinatorial Optimization", Evolutionary Computation in Combinatorial Optimization, (2017), ISBN: 978-3-319-55452-5; 91 - 107
• An Iterative Time-Bucket Refinement Algorithm for a Resource-Constrained Project Scheduling Problem / G. Raidl / Talk: TU Graz, Institute for Discrete Mathematics, TU Graz, Institute for Discrete Mathematics (invited); 2017-03-21
• Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments / J. Maschler, M. Riedler, G. Raidl / Talk: Computer Aided Systems Theory - EUROCAST 2017, Spain; 2017-02-19 - 2017-02-24; in: "Computer Aided Systems Theory - EUROCAST 2017", (2017), 106 - 107
• GRASP and VNS for a periodic VRP with time windows to deal with milk collection / A. Exposit, G. Raidl, J. Brito, J. Moreno-Perez / Talk: Computer Aided Systems Theory - EUROCAST 2017, Spain; 2017-02-19 - 2017-02-24; in: "Computer Aided Systems Theory - EUROCAST 2017", (2017), 90 - 91
• Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition / C. Kloimüllner, G. Raidl / Networks, 69 (2017), 3; 270 - 289
• Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm / P. Pop, S. Cosmin, B. Biesinger, B. Hu, G. Raidl / Carpathian Journal of Mathematics, 33 (2017), 3; 365 - 371
• A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem / F. Dusberger, G. Raidl / in: "Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies", issued by: Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies; Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies, 2017, ISBN: 978-3-319-42902-1, 385 - 391
• An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem / M. Riedler, T. Jatschka, J. Maschler, G. Raidl / International Transactions in Operational Research, 8 (2017)
• Hybrid Metaheuristics for Optimization Problems in Public Bike Sharing Systems / G. Raidl / 2017

2016

• Heuristic Approaches for Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers / B. Klocker, G. Raidl / Talk: Austrian Workshop on Metaheuristics, Graz; 2016-12-02
• Integrating Algebraic Dynamic Programming in Combinatorial Optimization / C. Bacher, G. Raidl / Talk: Austrian Workshop on Metaheuristics, Graz; 2016-12-02
• Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics / G. Raidl, T. Jatschka, M. Riedler, J. Maschler / Talk: International Workshop on Model-Based Metaheuristics, Brüssel, Belgien; 2016-09-04 - 2016-09-07; in: "Proceedings of the Sixth International Workshop on Model-based Metaheuristics", (2016), 104 - 107
• Particle Therapy Patient Scheduling: First Heuristic Approaches / J. Maschler, M. Riedler, M. Stock, G. Raidl / Talk: International Conference of the Practice and Theory of Automated Timetabling (PATAT), Udine, Italien; 2016-08-23 - 2016-08-26; in: "PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling", (2016), ISBN: 978-0-9929984-1-7; 223 - 244
• Algorithms for Vehicle Routing / G. Raidl / Talk: Workshop on Advances and Improvements in Service Delivery to Regional Development: Cases of Transportation and Health, La Laguna, Spain (invited); 2016-07-14 - 2016-07-16
• Particle Therapy Patient Scheduling: First Heuristic Approaches / J. Maschler, M. Riedler, M. Stock, G. Raidl / Talk: European Conference on Operational Research, Poznan, Polen; 2016-07-03 - 2016-07-06
• Cyclic Giant Tour Decoding for the EVRPTW / C. Bacher, G. Raidl / Talk: European Conference on Operational Research, Poznan, Polen; 2016-07-03 - 2016-07-06
• Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers / B. Klocker, H. Fleischner, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Plymouth, United Kingdom; 2016-06-08 - 2016-06-10; in: "Hybrid Metaheuristics - 10th International Workshop on Hybrid Metaheuristics", LNCS, 9668 (2016), ISBN: 978-3-319-39635-4; 87 - 103
• Districting and Routing for Security Control / M. Prischink, C. Kloimüllner, B. Biesinger, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Plymouth, United Kingdom; 2016-06-08 - 2016-06-10; in: "Hybrid Metaheuristics - 10th International Workshop on Hybrid Metaheuristics", LNCS, 9668 (2016), ISBN: 978-3-319-39636-1; 87 - 103
• Hybrid Metaheuristics -- Powerful Tools for Optimization / C. Blum, G. Raidl / Springer, 2016, ISBN: 978-3-319-30883-8; 172 pages
• Models and algorithms for competitive facility location problems with different customer behavior. / B. Biesinger, B. Hu, G. Raidl / Annals of Mathematics and Artificial Intelligence, 76 (2016), 1; 93 - 119
• New developments in metaheuristics and their applications / H. C. Lau, G. Raidl, P. Van Hentenryck / Journal of Heuristics, 22 (2016), 4; 359 - 363
• Large Neighborhood Search for the Most Strings with Few Bad Columns Problem / E. Lizarraga, M. Blesa, C. Blum, G. Raidl / Journal of Heuristics, 21 (2016), 1 - 15

2015

• A Logic-based Benders Decomposition Approach for the 3-Staged Strip Packing Problem / J. Maschler, G. Raidl / Talk: International Conference of the German, Austrian and Swiss Operations Research Societies, Wien; 2015-09-01 - 2015-09-04; in: "Operations Research Proceedings 2015 Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies", (2016), ISBN: 978-3-319-42901-4; 85 - 102
• On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics / E. Lizarraga, M. Blesa, C. Blum, G. Raidl / Talk: INISTA 2015, Madrid, Spain; 2015-08-02 - 2015-08-05; in: "Innovations in Intelligent Systems and Applications (INISTA), 2015 International Symposium on", D. Camacho et al. (ed.); (2015), ISBN: 978-1-4673-7751-5; 1 - 8
• Mixed Integer Programming Models for Hybrid Electric Vehicle Routing / C. Bacher, G. Raidl / Talk: VeroLog 2015, Universität Wien (invited); 2015-06-08 - 2015-06-10
• A Multi-Commodity FLow Based Model for Multi Layer Hierarchical Ring Network Design / C. Schauer, G. Raidl / Talk: International Network Optimization Conference (INOC), Warschau, Polen; 2015-05-18 - 2015-05-20; in: "Proceedings of INOC 2015 - 7th International Network Optimization Conference", (2016), ISSN: 1571-0653; 189 - 196
• An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands / B. Biesinger, B. Hu, G. Raidl / Talk: International Network Optimization Conference (INOC), Warschau, Polen; 2015-05-18 - 2015-05-20; in: "Proceedings of the 7th International Network Optimization Conference", Electronic Notes in Discrete Mathematics, 52 (2016), ISSN: 1571-0653; 245 - 252
• A New Solution Representation for the Firefighter Problem / B. Hu, A. Windbichler, G. Raidl / Talk: Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015, Kopenhagen, Dänemark; 2015-04-08 - 2015-04-10; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015", G. Ochoa, F. Chicano (ed.); 9026 (2015), ISBN: 978-3-319-16467-0; 25 - 35
• A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands / B. Biesinger, B. Hu, G. Raidl / Talk: Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015, Kopenhagen, Dänemark; 2015-04-08 - 2015-04-10; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015", G. Ochoa, F. Chicano (ed.); Springer, 9026 (2015), ISBN: 978-3-319-16467-0; 48 - 60
• Analyzing Decoding Strategies in a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem / C. Schauer, G. Raidl / Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia (ed.); (2015), ISBN: 978-84-606-5438-4; 81 - 82
• Solving the Longest Common Subsequence Problem Using a Parallel Ant Colony Optimization Algorithm / D. Markvica, C. Schauer, G. Raidl / Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia et al. (ed.); (2015), ISBN: 978-84-606-5438-4; 113 - 114
• A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems / C. Kloimüllner, P. Papazek, G. Raidl, B. Hu / Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia et al. (ed.); (2015), ISBN: 978-84-606-5438-4; 125 - 126
• A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles / C. Bacher, G. Raidl / Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia (ed.); (2015), ISBN: 978-84-606-5438-4; 119 - 120
• Heuristic Approaches for the Probabilistic Traveling Salesman Problem / B. Biesinger, C. Weiler, B. Hu, G. Raidl / Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia (ed.); (2015), ISBN: 978-84-606-5438-4; 99 - 100
• A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size / F. Dusberger, G. Raidl / Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia, J. Rodriguez, R. Moreno-Díaz, R. Moreno-Díaz (ed.); (2015), ISBN: 978-84-606-5438-4; 109 - 110
• Metaheuristics for the Two-Dimensional Container-Pre-Marshalling-Problem / A. Tus, A. Rendl, G. Raidl / Talk: LION 9, Lille, France; 2015-01-12 - 2015-01-15; in: "Learning and Intelligent Optimization", C. Dhaenens, L. Jourdan, M. Marmion (ed.); 8994 (2015), ISBN: 978-3-319-19084-6; 186 - 201
• A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem / B. Biesinger, B. Hu, G. Raidl / Journal of Heuristics, 21 (2015), 3; 391 - 431
• Decomposition based hybrid metaheuristics / G. Raidl / European Journal of Operational Research (invited), 244 (2015), 1; 66 - 76
• Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Problem / C. Blum, G. Raidl / Optimization Letters, online 07/2015 (2015), 1 - 17
• Numerical Optimization of Electro Hybrid Powertrains / T. Krenek, C. Bacher, G. Raidl, T. Lauer / MTZ worldwide, 76 (2015), 3; 46 - 52
• Numerische Optimierung elektrifizierter Antriebsstränge / T. Krenek, C. Bacher, G. Raidl, T. Lauer / MTZ - Motortechnische Zeitschrift, 76 (2015), 3; 66 - 74

2014

• Balancing Bicycle Sharing Systems / C. Kloimüllner, P. Papazek, B. Hu, G. Raidl / Talk: EULOG 2014, Wien; 2014-11-17 - 2014-11-18
• Variable Neighborhood Search Hybrids / G. Raidl / Keynote Lecture: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien (invited); 2014-10-08 - 2014-10-11
• Boosting an exact logic-based benders decomposition approach by variable neighborhood search. / G. Raidl, T. Baumhauer, B. Hu / Talk: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien; 2014-10-08 - 2014-10-11; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search", B. Jarboui, A. Sifaleras, A. Rebai (ed.); Elsevier Electronic Notes in Discrete Mathematics, 47 (2015), 149 - 156
• Variable neighbourhood search for integrated timetable design of railway infrastructure. / I. Grujicic, G. Raidl, A. Schöbel / Talk: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien; 2014-10-08 - 2014-10-11; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search", B. Jarboui, A. Sifaleras, A. Rebai (ed.); Elsevier Electronic Notes in Discrete Mathematics, 47 (2015), 141 - 148
• Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search. / F. Dusberger, G. Raidl / Talk: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien; 2014-10-08 - 2014-10-11; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search", B. Jarboui, A. Sifaleras, A. Rebai (ed.); Elsevier Electronic Notes in Discrete Mathematics, 47 (2015), 133 - 140
• Balancing bicycle sharing systems: An analysis of path relinking and recombination within a GRASP hybrid. / P. Papazek, C. Kloimüllner, B. Hu, G. Raidl / Talk: Parallel Problem solving from Nature - PPSN XIII, Ljubljana; 2014-09-13 - 2014-09-17; in: "Parallel Problem Solving from nature - PPSN XIII", T. Bartz - Beielstein, J. Branke, B. Filipic, J. Smith (ed.); Lecture Notes in Computer Science, Springer International Publishing, 8672 (2014), ISBN: 978-3-319-10761-5; 792 - 801
• An SME Transition from Plan-Driven to Hybrid Project Management with Agile Software Development Methods / S. Biffl, R. Mordinyi, G. Raidl, H. Steininger, D. Winkler / Talk: 21th EuroSPI Conference on Systems Software and Service Process Improvement, Industrial Track, Luxembourg, Luxemburg; 2014-06-25 - 2014-06-27; in: "Proceedings of the 21th EuroSPI Conference on Systems Software and Service Process Improvement, Industrial Track", Delta, (2014), ISBN: 978-87-7398-157-3
• A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. / F. Dusberger, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics 2014 - HM 2014, Hamburg; 2014-06-11 - 2014-06-13; in: "Hybrid Metaheuristics, 9th Int. Workshop, HM 2014", M. Blesa, C. Blum, S. Voß (ed.); LNCS / Springer, 8457 (2014), ISSN: 0302-9743; 85 - 99
• Speeding up logic-based benders' decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem. / G. Raidl, T. Baumhauer, B. Hu / Talk: International Workshop on Hybrid Metaheuristics 2014 - HM 2014, Hamburg; 2014-06-11 - 2014-06-13; in: "Hybrid Metaheuristics, 9th Int. Workshop, HM 2014", M. Blesa, C. Blum, S. Voß (ed.); (2014), ISBN: 978-3-319-07643-0; 183 - 197
• A metaheuristic approach for integrated timetable based design of railway infrastructure / I. Grujicic, G. Raidl, A. Schöbel, G. Besau / Talk: CETRA 2014, Split; 2014-04-28 - 2014-04-30; in: "Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA 2014", S. Lakusic (ed.); (2014), ISSN: 1848-9850; 691 - 696
• A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure / I. Grujicic, G. Raidl, A. Schöbel, G. Besau / Talk: 3rd International Conference on Road and Rail Infrastructure CETRA 2014, Split/HR; 2014-04-28 - 2014-04-30; in: "Road and Rail Infrastructure III, Proceedings of the Conference CETRA 2014", S. Lakusic (ed.); Department of Transportation, University of Zagreb, Zagreb/HR (2014), ISSN: 1848-9842; 691 - 696
• Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. / C. Kloimüllner, P. Papazek, B. Hu, G. Raidl / Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Granada; 2014-04-23 - 2014-04-25; in: "Evolutionary Computation in Combinatorial Optimization", C. Blum, G. Ochoa (ed.); Springer Berlin Heidelberg, 8600 (2014), ISBN: 978-3-662-44319-4; 73 - 84
• Reducing the number of simulations in operation strategy optimization for hybrid electric vehicles. / C. Bacher, T. Krenek, G. Raidl / Talk: 17th European Conference, EvoApplications 2014, Granada, Spanien; 2014-04-23 - 2014-04-25; in: "Applications of Evolutionary Computation, Lecture Notes in Computer Science", A. Esparcia-Alcázar, A. Mora (ed.); Springer Berlin Heidelberg, (2014), ISBN: 978-3-662-45522-7; 553 - 564
• An evolutionary algorithm for the leader-follower facility location problem with proportional customer behavior. / B. Biesinger, B. Hu, G. Raidl / Talk: Learning and Intelligent OptimizatioN Conference LION, Gainesville; 2014-02-16 - 2014-02-21; in: "Learning and Intelligent Optimization", P. Pardalos, M. Resende, C. Vogiatzis, J. Walteros (ed.); (2014), ISBN: 978-3-319-09584-4; 203 - 217
• A Memetic Algorithm for the Virtual Network Mapping Problem. / J. Inführ, G. Raidl / Journal of Heuristics (invited), Dezember 2014 (2014), 1 - 31
• PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. / M. Rainer-Harbach, P. Papazek, G. Raidl, B. Hu, C. Kloimüllner / Journal of Global Optimization (invited), April (2014), 1 - 33

2013

• A memetic algorithm for the virtual network mapping problem / J. Inführ, G. Raidl / Talk: Metaheuristics International Conference (MIC), Singapore; 2013-08-05 - 2013-08-08; in: "Proceedings of the 10th Metaheuristics International Conference", (2013), Paper ID 28, 10 pages
• Clique and independent set based grasp approaches for the regenerator location problem / P. Jahrmann, G. Raidl / Talk: Metaheuristics International Conference (MIC), Singapore; 2013-08-05 - 2013-08-08; in: "Proceedings of the 10th Metaheuristics International Conference", (2013), 1 - 10
• Metaheuristics and Hybrid Optimization Approaches - A Unifying View / G. Raidl / Talk: European Conference on Operational Research, Rom (invited); 2013-07-03
• Metaheuristics for the Static Balancing of Bicycle Sharing Systems / G. Raidl / Talk: European Conference on Operational Research, Rom; 2013-07-03
• Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations / G. Raidl, B. Hu, M. Rainer-Harbach, P. Papazek / Talk: International Workshop on Hybrid Metaheuristics (HM), Ischia, Italien; 2013-05-23 - 2013-05-25; in: "Hybrid Metaheuristics, 8th Int. Workshop, HM 2013", Volume 7919 (2013), ISBN: 978-3-642-38515-5; 130 - 143
• GRASP and variable neighborhood search for the virtual network mapping problem / J. Inführ, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Ischia, Italien; 2013-05-23 - 2013-05-25; in: "Hybrid Metaheuristics, 8th Int. Workshop, HM 2013", Lecture Notes in Computer Science, Volume 7919 (2013), ISBN: 978-3-642-38515-5; 159 - 173
• An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure / A. Schöbel, G. Raidl, I. Grujicic, G. Besau, G. Schuster / Talk: 5th International Seminar on Railway Operations Modelling and Analysis, Copenhagen; 2013-05-13 - 2013-05-15; in: "Proceedings", (2013), ISBN: 978-87-7327-246-6; Paper ID 21, 10 pages
• Balancing bicycle sharing systems: A variable neighborhood search approach / M. Rainer-Harbach, P. Papazek, B. Hu, G. Raidl / Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Wien; 2013-04-03 - 2013-04-05; in: "Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013", Volume 7832 (2013), ISBN: 978-3-642-37197-4; 121 - 132
• Solving the virtual network mapping problem with construction heuristics, local search and variable neighborhood descent / J. Inführ, G. Raidl / Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Wien; 2013-04-03 - 2013-04-05; in: "Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013", Lecture Notes in Computer Science, Volume 7832 (2013), ISBN: 978-3-642-37197-4; 250 - 261
• Using optimized virtual network embedding for network dimensioning / J. Inführ, D. Stezenbach, M. Hartmann, K. Tutschku, G. Raidl / Talk: International Conference on Networked Systems, NetSys 2013, Stuttgart, Germany; 2013-03-11 - 2013-03-15; in: "Proceedings of Networked Systems 2013", IEEE Computer Society, (2013), ISBN: 978-0-7695-4950-7; 118 - 125
• Optimization Approaches for Balancing Bicycle Sharing Systems / G. Raidl / Talk: Department of Business Administration, Production and Operations Management Group, University of Vienna, Wien (invited); 2013-03-08
• A memetic algorithm for the partition graph coloring problem / P. Pop, B. Hu, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spanien; 2013-02-10 - 2013-02-15; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory", (2013), ISBN: 978-84-695-6971-9; 167 - 169
• A pilot/vnd/grasp hybrid for balancing bicycle sharing systems / P. Papazek, G. Raidl, M. Rainer-Harbach, B. Hu / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spanien; 2013-02-10 - 2013-02-15; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory", (2013), ISBN: 978-84-695-6971-9; 223 - 225
• A mixed integer model for the stamina-aware sightseeing tour problem / B. Hu, W. Ölz, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spanien; 2013-02-10 - 2013-02-15; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory", (2013), ISBN: 978-84-695-6971-9; 200 - 202
• Reconstructing cross cut shredded documents with a genetic algorithm with solution archive / B. Biesinger, C. Schauer, B. Hu, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spanien; 2013-02-10 - 2013-02-15; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory", (2013), ISBN: 978-84-695-6971-9; 226 - 228
• A timeslot-filling based heuristic approach to construct high-school timetables / M. Pimmer, G. Raidl / in: "Advances in Metaheuristics", Springer, 2013, ISBN: 978-1-4614-6322-1, 143 - 158
• Proceedings of the 10th Metaheuristics International Conference / H. C. Lau, G. Raidl, P. Van Hentenryck / Singapore Management University, Singapore, 2013
• Stabilizing branch-and-price for constrained tree problems / M. Leitner, M. Ruthmair, G. Raidl / Networks, Volume 61 (2013), 2; 150 - 170
• Metaheuristics for solving a multimodal home-healthcare scheduling problem / G. Hiermann, M. Prandtstetter, A. Rendl, J. Puchinger, G. Raidl / Central European Journal of Operations Research, May 2013 (2013)
• A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem / P. Pop, B. Hu, G. Raidl / in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1", Springer, 2013, ISBN: 978-3-642-53855-1, 219 - 226
• A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems / P. Papazek, G. Raidl, M. Rainer-Harbach, B. Hu / in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1", Springer, 2013, ISBN: 978-3-642-53855-1, 372 - 379
• Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents / B. Biesinger, C. Schauer, B. Hu, G. Raidl / in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1", Springer, 2013, ISBN: 978-3-642-53855-1, 380 - 387

2012

• Hybrid Metaheuristics and Matheuristics / G. Raidl / Talk: International Conference on Metaheuristics and Nature Inspired Computing, Port El-Kantaoiui, Tunisia (invited); 2012-10-27 - 2012-10-31
• Balancing Bicycle Sharing Systems by Variable Neighborhood Search / G. Raidl, E. Causevic, B. Hu, M. Rainer-Harbach / Talk: EUROmC XXVIII VNS, Herceg Novi, Montenegro (invited); 2012-10-04 - 2012-10-07
• Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design / C. Schauer, G. Raidl / Poster: International Conference on Parallel Problem Solving From Nature (PPSN), Taormina, Italien; 2012-09-01 - 2012-09-05; in: "Parallel Problem Solving from Nature-PPSN XII", volume 7491 of LNCS (2012), ISBN: 978-3-642-32936-4; 458 - 467
• An Adaptive Layers Framework for Vehicle Routing Problems / M. Ruthmair, G. Raidl / Talk: International Symposium on Mathematical Programming, Berlin, Deutschland; 2012-08-19 - 2012-08-24
• An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem / B. Hu, G. Raidl / Talk: GECCO: Genetic and Evolutionary Computation Conference, Philadelphia, USA; 2012-07-07 - 2012-07-11; in: "Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation", (2012), 393 - 400
• A hybrid heuristic for multimodal homecare scheduling / A. Rendl, M. Prandtstetter, G. Hiermann, J. Puchinger, G. Raidl / Talk: International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, Nantes, Frankreich; 2012-05-28 - 2012-06-01; in: "Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems", volume 7298 of LNCS (2012), ISBN: 978-3-642-29827-1; 339 - 355
• On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem / M. Ruthmair, G. Raidl / Talk: International Symposium on Combinatorial Optimization (ISCO), Athen, Griechenland; 2012-04-17 - 2012-04-21; in: "Proceedings of the 2nd International Symposium on Combinatorial Optimization", volume 7422 of LNCS (2012), ISBN: 978-3-642-32146-7; 225 - 236
• A variable neighborhood search approach for the two-echelon location-routing problem / M. Schwengerer, S. Pirkwieser, G. Raidl / Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Malaga, Spain; 2012-04-11 - 2012-04-13; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2012", volume 7245 of LNCS (2012), ISBN: 978-3-642-29123-4; 13 - 24
• Applying (hybrid) metaheuristics to fuel consumption optimization of hybrid electric vehicles / T. Krenek, M. Ruthmair, G. Raidl, M. Planer / Talk: EvoStar, Malaga, Spain; 2012-04-11 - 2012-04-13; in: "Applications of Evolutionary Computation - EvoApplications 2012", volume 7248 of LNCS (2012), ISBN: 978-3-642-29177-7; 376 - 385
• An Adaptive Layers Framework for Resource-Constrained Network Design Problems / M. Ruthmair, G. Raidl / Talk: INFORMS Telecommunications Conference, Boca Raton, Florida, USA; 2012-03-15 - 2012-03-17
• Solving the post enrolment course timetabling problem by ant colony optimization / C. Nothegger, A. Mayer, A Chwatal, G. Raidl / Annals of Operations Research, Volume 194 (2012), 1; 325 - 339

2011

• A branch-and-cut-and-price algorithm for a fingerprint-template compression application / A Chwatal, C. Thöni, K. Oberlechner, G. Raidl / Poster: Federated Conference on Computer Science and Information Systems (FedCSIS), Szczecin, Poland; 2011-09-18 - 2011-09-21; in: "Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS)", (2011), 239 - 246
• Tackling the loading aspect of the vehicle routing problem with compartments / S. Pirkwieser, G. Raidl, J. Gottlieb / Talk: Metaheuristics International Conference (MIC), Udine, Italy; 2011-07-25 - 2011-07-28; in: "Proceedings of the 9th Metaheuristics International Conference", (2011), 679 - 681
• A timeslot-filling based heuristic approach to construct high-school timetables / M. Pimmer, G. Raidl / Talk: Metaheuristic International Conference (MIC), Udine, Italy; 2011-07-25 - 2011-07-28; in: "Proceedings of the 9th Metaheuristics International Conference", (2011), 349 - 358
• A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems / M. Ruthmair, G. Raidl / Talk: Conference on Integer Programming and Combinatorial Optimization (IPCO), New York, USA; 2011-06-15 - 2011-06-17; in: "Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV)", (2011), 376 - 388
• Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem / M. Leitner, M. Ruthmair, G. Raidl / Talk: International Network Optimization Conference (INOC), Hamburg, Deutschland; 2011-06-13 - 2011-06-16; in: "Network Optimization: 5th International Conference, INOC 2011", (2011), 124 - 138
• Introducing the virtual network mapping problem with delay, routing and location constraints / J. Inführ, G. Raidl / Talk: International Network Optimization Conference (INOC), Hamburg, Deutschland; 2011-06-13 - 2011-06-16; in: "Network Optimization: 5th International Conference", (2011), ISBN: 978-3642215261; 105 - 117
• Stabilized column generation for the rooted delay-constrained Steiner tree problem / M. Leitner, M. Ruthmair, G. Raidl / Talk: Workshop on Applied Combinatorial Optimization (ALIO/EURO), Porto, Portugal; 2011-05-04 - 2011-05-06; in: "Proceedings of the VII ALIO/EURO - Workshop on Applied Combinatorial Optimization", (2011), 250 - 253
• Improved packing and routing of vehicles with compartments / S. Pirkwieser, G. Raidl, J. Gottlieb / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", volume 6927 of LNCS (2012), ISBN: 978-3642275487; 392 - 399
• Automatic generation of 2-antwars players with genetic programming / J. Inführ, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", volume 6927 of LNCS (2012), ISBN: 978-3642275487; 248 - 255
• An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem / B. Hu, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", volume 6927 of LNCS (2012), ISBN: 978-3642275487; 287 - 294
• A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / M. Berlakovich, M. Ruthmair, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", volume 6927 of LNCS (2012), ISBN: 978-3642275487; 256 - 263
• A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem / M. Ruthmair, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", (2011), ISBN: 978-84-693-9560-8; 351 - 358
• Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location / M. Leitner, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", Volume 6927 (2011), ISBN: 978-3-642-27548-7; 295 - 302
• Automatic generation of 2-AntWars players with Genetic Programming / J. Inführ, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", (2011), ISBN: 978-84-693-9560-8; 244 - 246
• Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem / M. Ruthmair, A. Hubmer, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", (2011), ISBN: 978-84-693-9560-8; 285 - 287
• Variable neighborhood search for capacitated connected facility location / M. Leitner, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", (2011), ISBN: 978-84-693-9560-8; 261 - 263
• A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / M. Berlakovich, M. Ruthmair, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", (2011), ISBN: 978-84-693-9560-8; 247 - 249
• An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem / B. Hu, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", (2011), ISBN: 978-84-693-9560-8; 256 - 258
• Hybrid metaheuristics in combinatorial optimization: A survey / C. Blum, J. Puchinger, G. Raidl, A. Roli / Applied Soft Computing, Volume 11 (2011), Issue 6; 4135 - 4151
• Branch-and-cut-and-price for capacitated connected facility location / M. Leitner, G. Raidl / Journal of Mathematical Modelling and Algorithms, Volume 10 (2011), Number 3; 245 - 267
• Solving the minimum label spanning tree problem by mathematical programming techniques / A Chwatal, G. Raidl / Advances in Operations Research, Volume 2011 (2011)
• Improved packing and routing of vehicles with compartments / S. Pirkwieser, G. Raidl, J. Gottlieb / in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", Universidad de Las Palmas de Gran Canaria, 2011, ISBN: 978-84-693-9560-8, 302 - 304

2010

• A memetic algorithm with population management for the generalized minimum vertex-biconnected network problem / A. Pagacz, B. Hu, G. Raidl / Talk: International Conference on INTELLIGENT NETWORKING AND COLLABORATIVE SYSTEMS, Thessaloniki, Greece; 2010-11-24 - 2010-11-26; in: "2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design", (2010), 356 - 361
• A memetic algorithm for reconstructing cross-cut shredded text documents / C. Schauer, M. Prandtstetter, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Wien; 2010-10-01 - 2010-10-02; in: "Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010", (2010), 103 - 117
• Variable neighborhood search coupled with ILP-based large neighborhood searches for the (periodic) location-routing problem / S. Pirkwieser, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Wien; 2010-10-01 - 2010-10-02; in: "Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010", (2010), 174 - 189
• Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem / M. Ruthmair, G. Raidl / Talk: International Conference on Parallel Problem Solving From Nature (PPSN), Krakow, Poland; 2010-09-11 - 2010-09-15; in: "Parallel Problem Solving from Nature - PPSN XI", (2010), 391 - 400
• Solving the minimum label spanning tree problem by ant colony optimization / A Chwatal, G. Raidl / Talk: Conference on Genetic and Evolutionary Methods (GEM), Las Vegas, Nevada, USA; 2010-07-12 - 2010-07-15; in: "Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods", (2010), 91 - 97
• Fitting multi-planet transit models to photometric time-data series by evolution strategies / A Chwatal, G. Raidl, M. Zöch / Talk: GECCO: Genetic and Evolutionary Computation Conference, Portland, Oregon, USA; 2010-07-07 - 2010-07-11; in: "Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation", (2010), 7 pages
• Matheuristics for the periodic vehicle routing problem with time windows / S. Pirkwieser, G. Raidl / Talk: International Workshop on Model-Based Metaheuristics, Wien; 2010-06-28 - 2010-06-30; in: "Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics,", (2010), 83 - 95
• Similarity searching in sequences of complex events / H. Obweger, M. Suntinger, J. Schiefer, G. Raidl / Talk: International Conference on Research Challenges in Information Science (RCIS), Nizza, Frankreich; 2010-05-19 - 2010-05-21; in: "Proceedings of the Fourth International Conference on Research Challenges in Information Science - RCIS 2010", (2010), 631 - 639
• Trend-based similarity search in time-series data / M. Suntinger, H. Obweger, J. Schiefer, P. Limbeck, G. Raidl / Talk: International Conference on Advances in Databases, Knowledge, and Data Applications (DBKDA), Menuires, FRANCE; 2010-04-11 - 2010-04-16; in: "Proceedings of the Second International Conference on Advances in Database, Knowledge, and Data Applications - DBKDA 2010", (2010), 97 - 106
• Enhancing genetic algorithms by a trie-based complete solution archive / G. Raidl, B. Hu / Talk: EvoCOP 2010, Istanbul, Turkey; 2010-04-07 - 2010-04-09; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010", (2010), 239 - 251
• Multilevel variable neighborhood search for periodic routing problems / S. Pirkwieser, G. Raidl / Talk: EvoCOP 2010, Istanbul, Turkey; 2010-04-07 - 2010-04-09; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010", (2010), 226 - 238
• Strong lower bounds for a survivable network design problem / M. Leitner, G. Raidl / Talk: International Symposium on Combinatorial Optimization (ISCO), Hammamet, Tunesien; 2010-03-24 - 2010-03-26; in: "ISCO 2010 - International Symposium on Combinatorial Optimization", 36 (2010), 295 - 302
• Hybrid metaheuristics / C. Blum, J. Puchinger, G. Raidl, A. Roli / in: "Hybrid Optimization -The Ten Years of CPAIOR", Springer, 2010, 305 - 336
• Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 / M. Blesa, C. Blum, G. Raidl, A. Roli, M. Sampels / Springer, 2010, ISBN: 978-3642160530
• The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search / B. Hu, M. Leitner, G. Raidl / Networks, 55 (2010), 3; 257 - 275
• The multidimensional knapsack problem: Structure and algorithms / J. Puchinger, G. Raidl, U. Pferschy / Informs Journal on Computing, 22 (2010), 2; 250 - 265
• A brief survey on hybrid metaheuristics / C. Blum, J. Puchinger, G. Raidl, A. Roli / in: "Proceedings of BIOMA 2010 - 4th International Conference on Bioinspired Optimization Methods and their Applications", Jozef Stefan Institute, Ljubljana, Slovenia, 2010, ISBN: 978-961-264-017-0, 3 - 16

2009

• Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / G. Raidl / Keynote Lecture: Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Znaim, Tschechien (invited); 2009-11-13 - 2009-11-15
• Innovative Lösungen für Routenplanung, Packungsprobleme und Lagerlogistik / G. Raidl / Talk: Aktuelles Know-How der TU Wien für Logistik und Distribution, Ausseninstitut-Technologietransfer, Wien (invited); 2009-10-21
• Solving a video-server load re-balancing problem by mixed integer programming and hybrid variable neighborhood search / J. Walla, M. Ruthmair, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Udine, Italien; 2009-10-16 - 2009-10-17; in: "Hybrid Metaheuristics 2009, volume 5818 of LNCS", (2009), ISBN: 978-3-642-04917-0; 84 - 99
• Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows / S. Pirkwieser, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Udine, Italien; 2009-10-16 - 2009-10-17; in: "Proceedings of Hybrid Metaheuristics - Sixth International Workshop", (2009), 45 - 59
• Computing optimized stock (re-)placements in last-in, first-out warehouses / U. Ritzinger, M. Prandtstetter, G. Raidl / Talk: Logistik Management, Hamburg, Deutschland; 2009-09-02 - 2009-09-04; in: "Logistik Management", (2009), ISBN: 978-3-7908-2361-5; 279 - 298
• A memetic algorithm for the generalized minimum vertex-biconnected network problem / B. Hu, G. Raidl / Talk: Conference on Hybrid Intelligent Systems - HIS, Shenyang, China; 2009-08-12 - 2009-08-14; in: "9th International Conference on Hybrid Intelligent Systems - HIS 2009", (2009), 6 pages
• Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques / S. Pirkwieser, G. Raidl / Talk: Metaheuristic International Conference (MIC), Hamburg, Deutschland; 2009-07-13 - 2009-07-16; in: "Proceedings of the 8th Metaheuristic International Conference (MIC 2009)", (2009), 10 pages
• A lagrangian decomposition based heuristic for capacitated connected facility location / M. Leitner, G. Raidl / Talk: Metaheuristic International Conference (MIC), Hamburg; 2009-07-13; in: "Proceedings of the 8th Metaheuristic International Conference (MIC 2009)", (2009)
• Meta-heuristics for reconstructing cross cut shredded text documents / M. Prandtstetter, G. Raidl / Talk: GECCO: Genetic and Evolutionary Computation Conference, Montreal, Kanada; 2009-07-08 - 2009-07-12; in: "Proceedings of the 11th annual conference on Genetic and evolutionary computation", (2009), 8 pages
• Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on Euclidean instances / M. Gruber, G. Raidl / Talk: GECCO: Genetic and Evolutionary Computation Conference, Montreal, Kanada; 2009-07-08 - 2009-07-12; in: "Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation", (2009), 8 pages
• Kombinationen von Metaheuristiken und Methoden der mathematischen Programmierung zur Lösung schwieriger Netzwerkdesign-Probleme / G. Raidl / Talk: Upper Austrian University of Applied Sciences, Department of Software Engineering, Hagenberg (invited); 2009-05-06
• Solving a multi-constrained network design problem by lagrangean decomposition and column generation / A Chwatal, N. Musil, G. Raidl / Talk: International Network Optimization Conference (INOC), Pisa; 2009-04-26 - 2009-04-29; in: "Proceedings of the International Network Optimization Conference 2009", (2009), 7 pages
• A column generation approach for the periodic vehicle routing problem with time windows / S. Pirkwieser, G. Raidl / Talk: International Network Optimization Conference (INOC), Pisa; 2009-04-26 - 2009-04-29; in: "Proceedings of the International Network Optimization Conference 2009", (2009), 6 pages
• Accelerating column generation for a survivable network design problem / M. Leitner, G. Raidl, U. Pferschy / Talk: International Network Optimization Conference (INOC), Pisa; 2009-04-26 - 2009-04-29; in: "Proceedings of the International Network Optimization Conference 2009", (2009), 8 pages
• Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / G. Raidl / Talk: University of Nottingham, School of Computer Science, Nottingham, United Kingdom (invited); 2009-04-22
• A hybrid algorithm for computing tours in a spare parts warehouse / M. Prandtstetter, G. Raidl, T. Misar / Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Tübingen, Deutschland; 2009-04-15 - 2009-04-17; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2009", Springer, (2009), 25 - 36
• A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / M. Ruthmair, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spanien; 2009-02-15 - 2009-02-20; in: "Computer Aided Systems Theory - EUROCAST 2009, volume 5717 of LNCS", (2009), ISBN: 978-3-642-04771-8; 713 - 720
• Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics / M. Gruber, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Las Palmas de Gran Canaria, Spanien; 2009-02-15 - 2009-02-20; in: "Computer Aided Systems Theory - EUROCAST 2009, 12th International Conference on Computer Aided Systems Theory", (2009), ISBN: 978-3-642-04771-8; 665 - 672
• A Kruskal-based heuristic for the rooted delay-constrained minimum spanning tree problem / M. Ruthmair, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria; 2009-02-15 - 2009-02-20; in: "Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)", (2009), 244 - 246
• Cluster-based (meta-)heuristics for the Euclidean bounded diameter minimum spanning tree problem / M. Gruber, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria; 2009-02-15 - 2009-02-20; in: "Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)", (2009), 228 - 231
• Fitting rectangular signals to time series data by metaheuristic algorithms / A Chwatal, G. Raidl / Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria; 2009-02-15 - 2009-02-20; in: "Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)", (2009), 222 - 225
• Fitting multi-planet transit models to corot time-data series by evolutionary algorithms / A Chwatal, G. Wuchterl, G. Raidl / Poster: COROT, Paris; 2009-02-02 - 2009-02-05
• MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics / J. Puchinger, G. Raidl, S. Pirkwieser / in: "Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,Volume 10 of Annals of Information Systems", Springer, 2009, ISBN: 978-1441913050, 71 - 102
• (Meta-)heuristic separation of jump cuts in a branch&cut approach for the bounded diameter minimum spanning tree problem / M. Gruber, G. Raidl / in: "Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,volume 10 of Annals of Information Systems", Springer, 2009, ISBN: 978-1-4419-1305-0, 209 - 230
• Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference / G. Raidl et al. / ACM Press, 2009, ISBN: 978-1-60558-505-5; 1728 pages
• Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates. / A Chwatal, G. Raidl, K. Oberlechner / Journal of Mathematical Modelling and Algorithms, Volume 8 (2009), 3; 293 - 334

2008

• Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / G. Raidl / Talk: First Int. Workshop on Information Network Design, Kitakyushu City, Fukuoka, Japan (invited); 2008-12-05
• Cooperative Hybrids for Combinatorial Optimization / G. Raidl / Talk: Int. Workshop on Nature Inspired Cooperative Strategies for Optimization, Puerto de La Cruz, Tenerife, Spain (invited); 2008-11-13
• A variable neighborhood search for the periodic vehicle routing problem with time windows / S. Pirkwieser, G. Raidl / Talk: EU/MEeting, Troyes, Frankreich; 2008-10-23 - 2008-10-24; in: "Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing", (2008)
• Combining forces to reconstruct strip shredded text documents / M. Prandtstetter, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Malaga, Spanien; 2008-10-08 - 2008-10-09; in: "Hybrid Metaheuristics 2008", (2008), 175 - 189
• Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks / M. Leitner, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Malaga, Spanien; 2008-10-08 - 2008-10-09; in: "Hybrid Metaheuristics 2008", (2008), 158 - 174
• A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem / G. Raidl, M. Gruber / Talk: International Conference of Numerical Analysis and Applied Mathematics (ICNAAM), Korfu, Griechenland; 2008-09-16 - 2008-09-20; in: "Proceedings of the International Conference on Numerical Analysis and Applied Mathematics", (2008), 446 - 449
• Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem / B. Hu, G. Raidl / Talk: Conference on Hybrid Intelligent Systems - HIS, Barcelona, Spanien; 2008-09-10 - 2008-09-12; in: "8th International Conference on Hybrid Intelligent Systems", (2008), 73 - 77
• Solving the post enrolment course timetabling problem by ant colony optimization / A. Mayer, C. Nothegger, A Chwatal, G. Raidl / Talk: PATAT 2008, Montreal, Canada; 2008-08-18 - 2008-08-22; in: "Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling", (2008), 13 pages
• Variable neighborhood search for a prize collecting capacity constrained connected facility location problem / M. Leitner, G. Raidl / Talk: 2008 International Symposium on Applications and the Internet SAINT 2008, Turku, Finland; 2008-07-28 - 2008-08-01; in: "Proceedings of the 2008 International Symposium on Applications and the Internet", IEEE Computer Society, (2008), ISBN: 978-0-7695-3297-4; 233 - 236
• Heuristic cut separation in a branch&cut approach for the bounded diameter minimum spanning tree problem / M. Gruber, G. Raidl / Talk: 2008 International Symposium on Applications and the Internet SAINT 2008, Turku, Finland; 2008-07-28 - 2008-08-01; in: "Proceedings of the 2008 International Symposium on Applications and the Internet", IEEE Computer Society, (2008), ISBN: 978-0-7695-3297-4; 261 - 264
• Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms / S. Pirkwieser, G. Raidl / Talk: GECCO: Genetic and Evolutionary Computation Conference, Atlanta, USA; 2008-07-12 - 2008-07-16; in: "Proceedings of the 10th annual conference on Genetic and evolutionary computation", (2008), 323 - 330
• Exact methods and metaheuristic approaches for deriving high quality fully resolved consensus trees / S. Pirkwieser, R. Ruiz-Torrubiano, G. Raidl / Poster: BIRD'08 2nd International Conference on Bioinformatics Research and Development, Wien (invited); 2008-07-07 - 2008-07-09
• (Meta-)heuristic separation of jump cuts for the bounded diameter minimum spanning tree problem / M. Gruber, G. Raidl / Talk: Matheuristics2008 - Second International Workshop on Model Based Metaheuristics, Bertinoro, Italien; 2008-06-16 - 2008-06-18; in: "Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics", (2008)
• Effective neighborhood structures for the generalized traveling salesman problem / B. Hu, G. Raidl / Talk: 8th European Conference, EvoCOP 2008, Naples, Italy; 2008-03-26 - 2008-03-28; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2008", LNCS/Springer Berlin, 4972/2008/ Heidelberg (2008), ISSN: 0302-9743; 36 - 47
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization / G. Raidl, J. Puchinger / in: "Hybrid Metaheuristics - An Emergent Approach for Combinatorial Optimization, volume 114 of Studies in Computational Intelligence", Springer, 2008, 31 - 62
• A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem / S. Pirkwieser, G. Raidl, J. Puchinger / in: "Recent Advances in Evolutionary Computation for Combinatorial Optimization", Springer, 2008, 69 - 85
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search / J. Puchinger, G. Raidl / Journal of Heuristics (invited), 14 (2008), 5; 457 - 472
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem / M. Prandtstetter, G. Raidl / European Journal of Operational Research (invited), 191 (2008), 3; 1004 - 1022
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem / B. Hu, M. Leitner, G. Raidl / Journal of Heuristics, 14 (2008), 5; 473 - 499

2007

• Fingerprint template compression by solving a minimum label $k$-node subtree problem / G. Raidl, A Chwatal / Talk: International Conference of Numerical Analysis and Applied Mathematics (ICNAAM), Korfu, Griechenland; 2007-09-16 - 2007-09-20; in: "International Conference of Numerical Analysis and Applied Mathematics", (2007), ISBN: 978-0-7354-0447-2; 444 - 447
• Applying branch-and-cut for compressing fingerprint templates / A Chwatal, G. Raidl / Talk: EURO XXII: 22nd European Conference on Operational Research, Prag, Tschechische Republik; 2007-07-08 - 2007-07-11
• Compressing fingerprint templates by solving an extended minimum label spanning tree problem. / A Chwatal, G. Raidl, O. Dietzel / Talk: MIC 2007: The Seventh Metaheuristics International Conference, Montréal, Canada; 2007-06-25 - 2007-06-29; in: "Proceedings of the Seventh Metaheuristics International Conference (MIC)", (2007), 3 pages
• A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks / D. Wagner, U. Pferschy, P. Mutzel, G. Raidl, P. Bachhiesl / Talk: International Network Optimization Conference, Spa, Belgien; 2007-04-22 - 2007-04-25; in: "Proceedings of the International Network Optimization Conference 2007", (2007)
• Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem / M. Leitner, B. Hu, G. Raidl / Talk: International Network Optimization Conference, Spa, Belgien; 2007-04-22 - 2007-04-25; in: "Proceedings of the International Network Optimization Conference 2007", (2007)
• Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem / S. Pirkwieser, G. Raidl, J. Puchinger / Talk: EvoCOP 2007 - Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation, Valencia, Spanien; 2007-04-11 - 2007-04-13; in: "Evolutionary Computation in Combinatorial Optimization: 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings", (2007), ISBN: 978-3540716143; 176 - 187
• Determining orbital elements of extrasolar planets by evolution strategies. / A Chwatal, G. Raidl / Talk: 11th International Conference on Computer Aided Systems Theory (EUROCAST), Las Palmas de Gran Canaria, Spanien; 2007-02-12 - 2007-02-16; in: "EUROCAST 2007 Conference Proceedings, 2007", R. Moreno-Díaz (ed.); (2007)
• Reconstructing Sheets of Manually Torn Paper / M. Prandtstetter, G. Raidl, P. Schüller / Talk: 11th International Workshop on Combinatorial Optimization, Aussois, Frankreich; 2007-01-08 - 2007-01-12
• Models and algorithms for three-stage two-dimensional bin packing / J. Puchinger, G. Raidl / European Journal of Operational Research, 183 (2007), 3; 1304 - 1327
• CyMATE: A new tool for methylation analysis of plant genomic DNA after bisulfite sequencing / J. Hetzl, A.M. Foerster, G. Raidl, O. Mittelsten Scheid / Plant Journal, 51 (2007), 3; 526 - 536
• Determining orbital elements of extrasolar planets by evolution strategies. / A Chwatal, G. Raidl / in: "Computer Aided Systems Theory - EUROCAST 2007", R. Moreno-Díaz (ed.); Springer, Lecture Notes in Computer Science, Vol. 4739, 2007, ISBN: 978-3-540-75866-2, 870 - 877

2006

• Variable neighborhood descent with self-adaptive neighborhood-ordering. / B. Hu, G. Raidl / Talk: 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics, Malaga; 2006-11-16 - 2006-11-17; in: "Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics", C. Cotta, A. Fernandez, J. Gallardo (ed.); Malaga, Spanien (2006)
• A unified view on hybrid metaheuristics. / G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Gran Canaria, Spanien; 2006-10-13 - 2006-10-15; in: "Hybrid Metaheuristics - Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-14, 2006, Proceedings", F. Almeida et al. (ed.); Springer, Heidelberg (2006), ISBN: 978-3-540-46384-9; 1 - 12
• Metaheuristics for Solving a Scheduling Problem in Car Manufacturing / G. Raidl / Talk: ICAM5 - Fifth International Conference on Applied Mathematics, Baia Mare, Rumänien; 2006-09-21 - 2006-09-25
• A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. / D. Wagner, G. Raidl, U. Pferschy, P. Mutzel, P. Bachhiesl / Talk: Operations Research, Karlsruhe, Deutschland; 2006-09-06 - 2006-09-08; in: "Operations Research Proceedings 2006, Karlsruhe", Springer, Heidelberg (2007), ISBN: 978-3-540-69994-1
• Large Neighborhoods in Variable Neighborhood Search Approaches for Generalized Network Design Problems / B. Hu, M. Leitner, G. Raidl / Talk: 1st Workshop on Mathematical Contributions to Metaheuristics (Matheuristics 2006), Bertinoro, Italien; 2006-08-27 - 2006-08-30
• Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem / G. Raidl, B. Hu, M. Leitner / Talk: 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brasilien; 2006-07-30 - 2006-08-04
• Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. / M. Gruber, J van Hemert, G. Raidl / Talk: GECCO: Genetic and Evolutionary Computation Conference, Seattle; 2006-07-08 - 2006-07-12; in: "Proceedings of the Genetic and Evolutionary Computation Conference - GECCO 2006", M. Keijzer et al. (ed.); New York (2006), ISBN: 1-59593-186-4; 1187 - 1194
• The core concept for the multidimensional knapsack problem. / J. Puchinger, G. Raidl, U. Pferschy / Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Budapest, Ungarn; 2006-04-10 - 2006-04-12; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2006, volume 3906 of LNCS", J. Gottlieb, G. Raidl (ed.); Springer, Heidelberg (2006), ISBN: 978-3-540-33178-0; 195 - 208
• Two Integer Linear Programming Approaches for Solving the Car Sequencing Problem / M. Prandtstetter, G. Raidl / Talk: 10th International Workshop on Combinatorial Optimization, Aussois, Frankreich; 2006-01-09 - 2006-01-13
• Evolutionary Computation in Combinatorial Optimization - 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006. Proceedings. / J. Gottlieb, G. Raidl / Springer, Heidelberg, 2006, ISBN: 978-3-540-33178-0; 293 pages
• Biased Mutation Operators for Subgraph-Selection Problems / G. Raidl, G. Koller, B. Julstrom / IEEE Transactions on Evolutionary Computation, Volume 10 (2006), 2; 145 - 156
• Cleaning of raw peptide ms/ms spectra: Improved protein identification following deconvolution of multiply charged peaks, isotope clusters, and removal of background noise. / N. Mujezinovic, G. Raidl, J. Hutchins, J. Peters, K. Mechtler, F. Eisenhaber / Proteomics, Vol 6 (2006), 19; 5117 - 5131
• Evolutionary approach to constrained minimum spanning tree problem. / A. Pagacz, G. Raidl, S. Zawislak / in: "Evolutionary Computation and Global Optimization 2006, Murzasichle, Poland, 2006.", J. Arabasa (ed.); Oficyna Wydawnicza Politechniki Warszawskiej, Murzasichle, Polen, 2006, ISSN: 0137-2343, 331 - 341
• Models and algorithms for three-stage two-dimensional bin packing. / J. Puchinger, G. Raidl / Report for European Journal of Operations Research, Feature Issue on Cutting and Packing; 2006; 33 pages
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. / J. Puchinger, G. Raidl / Report for submitted to Journal of Heuristics.; Report No. TR 186-1-06-02, 2006; 33 pages
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. / B. Hu, M. Leitner, G. Raidl / Report for Journal of Heuristics; Report No. Technical Report TR 186-1-06-01, 2006; 36 pages

2005

• Computing generalized minimum spanning trees with variable neighborhood search. / B. Hu, M. Leitner, G. Raidl / Talk: MECVNS 2005 (XVIII Mini EURO Conference on VNS), Teneriffa, Spanien; 2005-11-23 - 2005-11-25; in: "Proceedings of the XVIII Mini EURO Conference on VNS", P. Hansen et al. (ed.); (2005), ISBN: 84-689-5679-1
• Variable neighborhood search for the bounded diameter minimum spanning tree problem. / M. Gruber, G. Raidl / Talk: MECVNS 2005 (XVIII Mini EURO Conference on VNS), Teneriffa, Spanien; 2005-11-23 - 2005-11-25; in: "Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search", P. Hansen et al. (ed.); (2005), ISBN: 84-689-5679-1
• A variable neihborhood search approach for solving the car sequencing problem. / M. Prandtstetter, G. Raidl / Talk: MECVNS 2005 (XVIII Mini EURO Conference on VNS), Teneriffa, Spanien; 2005-11-23 - 2005-11-25; in: "Proceedings of the XVIII Mini EURO Conference on VNS", P. Hansen et al. (ed.); (2005), ISBN: 84-689-5679-1
• Relaxation guided variable neighborhood search. / J. Puchinger, G. Raidl / Talk: MECVNS 2005 (XVIII Mini EURO Conference on VNS), Teneriffa, Spanien; 2005-11-23 - 2005-11-25; in: "Proceedings of the XVIII Mini EURO Conference on VNS", P. Hansen et al. (ed.); (2005), ISBN: 84-689-5679-1
• Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem. / J. Puchinger, G. Raidl, M. Gruber / Talk: MIC2005 (The 6th Metaheuristics International Conference), Wien; 2005-08-22 - 2005-08-26; in: "Proceedings of MIC2005, the 6th Metaheuristics International Conference", (2005)
• Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. / J. Puchinger, G. Raidl / Talk: IWINAC 2005 (First International Work-Conference on the Interplay Between Natural and Artificial Computation), Canary Islands, Spanien; 2005-06-15 - 2005-06-18; in: "Artifical Intelligence and Knowledge Engineering Applications: A Bioinspired Approach", J. Mira (ed.); Springer, Lecture Notes in Computer Science 3562 (2005), ISBN: 3-540-26319-5; 41 - 53
• A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem. / M. Gruber, G. Raidl / Talk: INOC 2005 (2nd International Network Optimization Conference), Lissabon, Portugal; 2005-03-20 - 2005-03-23; in: "Proceedings of the 2nd International Network Optimization Conference", Volume 1 (2005), ISSN: 1762-5734; 178 - 185
• GECCO: Genetic And Evolutionary Computation Conference Conference Proceedings / H. Beyer, G. Raidl et al. / ACM Press, 2005, ISBN: 1-59593-038-8; 2229 pages
• Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings (LNCS 3448) / G. Raidl, J. Gottlieb / Springer, Heidelberg, 2005, ISBN: 3-540-25337-8; 271 pages
• Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. / G. Raidl, J. Gottlieb / Evolutionary Computation, volume 13 (2005), number 4; 441 - 475
• A variable neihborhood search approach for solving the car sequencing problem. / M. Prandtstetter, G. Raidl / Report for European Journal of Operations Research (EJOR); 2005; 24 pages

2004

• An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem / G. Raidl / Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien; 2004-09-18 - 2004-09-22
• An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing / G. Raidl / Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien; 2004-09-18 - 2004-09-22
• Some Thoghts on How to Make Memetic Algorithms for Multiobjective Knapsack Problems / G. Raidl / Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham; 2004-09-18 - 2004-09-22
• New ILP Approaches for 3-Staged Two-Dimensional Bin Packing / G. Raidl / Talk: EUROXX: 20th European Conference on Operational Research, Rhodos; 2004-07-04 - 2004-07-07
• Hybrid Estimation of Distribution on Algorithm for Multiobjective Knapsack Problems / G. Raidl / Talk: EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal; 2004-04-05 - 2004-04-07
• Solving a real-world glass cutting problem / J. Puchinger, G. Raidl, G. Koller / Talk: EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal; 2004-04-05 - 2004-04-07
• An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem / G. Raidl / Talk: ACM Symposium on Applied Computing, Nicosia; 2004-03-14 - 2004-03-17
• Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings / J. Gottlieb, G. Raidl / Springer, Heidelberg, 2004, ISBN: 3-540-21367-8; 241 pages
• Applications of Evolutionary Computing: EvoWorkshops 2004 - Lecture Notes in Computer Science 3004 / G. Raidl et al. / Springer, Berlin Heidelberg New York, 2004, ISBN: 3-540-21378-3; 562 pages
• An evolutionary algorithm for the maximum weight trace formulation of the multiple sequence alignment problem. / G. Koller, G. Raidl / in: "Parallel Problem Solving from Nature - PPSN VIII", X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervós (ed.); issued by: Lecture Notes in Computer Science 3242; Springer, Berlin Heidelberg New York, 2004, ISBN: 3-540-23092-0, 302 - 311
• An improved hybrid genetic algorithm for the generalized assignment problem. / G. Raidl, H. Feltl / in: "Proceedings of the 2003 ACM Symposium on Applied Computing", H. M. Haddad et al. (ed.); ACM, 2004, ISBN: 1-58113-812-1, 990 - 995
• An evolutionary algorithm for column generation in integer programming: an effective approach for 2D bin packing. / J. Puchinger, G. Raidl / in: "Parallel Problem Solving from Nature - PPSN VIII", X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervós et al. (ed.); issued by: Lecture Notes in Computer Science 3242; Springer, Berlin Heidelberg New York, 2004, ISBN: 3-540-23092-0, 642 - 651
• Solving a real-world glass cutting problem. / J. Puchinger, G. Raidl, G. Koller / in: "Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004", issued by: Lecture Notes in Computer Science 3004; Springer, Heidelberg, 2004, ISBN: 3-540-21367-8, 165 - 176
• Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem / G.W. Klau, I. Ljubic, A. Moser, P. Mutzel, P. Neuner, U. Pferschy, G. Raidl, R. Weiskircher / in: "Genetic and Evolutionary Computation - GECCO 2004", K. Deb, R. Poli, W. Banzhaf, H. Beyer, E. Burke, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, O. Holland, P. Lanzi, A. Tettamanzi, D. Thierens, A. Tyrrell (ed.); issued by: Lecture Notes in Computer Science 3102; Springer, 2004, ISBN: 3-540-22343-6, 1304 - 1315
• Models and algorithms for three-stage two-dimensional bin packing. / J. Puchinger, G. Raidl / Report for Technical Report TR 186-1-04-04, submitted to EJOR; 2004
• Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. / G. Raidl, J. Gottlieb / Report for Technischer Report TR 186-1-04-05; 2004
• Biased mutation operators for subgraph-selection problems. / G. Raidl, G. Koller, B. Julstrom / Report for Technischer Report TR 186-1-04-06; 2004

2003

• Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem / G. Raidl / Talk: Research Institute of Molecular Pathology, Biocenter Vienna, Wien; 2003-08-31
• Evolutionary Computation for Combinatorial Optimization / G. Raidl / Talk: EvoNet Summer School 2003, University of Parma, Italy; 2003-08-24 - 2003-08-31
• On the Hybridization of Evolutionary Algorithms / G. Raidl / Talk: Genetic and Evolutionary Computation Conference (GECCO 2003), Chicago, IL; 2003-07-12 - 2003-07-16
• Applications of Evolutionary Computing / G. Raidl et al. / Springer, LNCS 2611, 2003, ISBN: 3-540-00976-0; 708 pages
• Edge-Sets: An Effective Evolutionary Coding of Spanning Trees / G. Raidl, B. Julstrom / IEEE Transactions on Evolutionary Computation, 7 (2003), 3; 225 - 239
• A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs / I. Ljubic, G. Raidl / Journal of Heuristics, 9 (2003), 401 - 427
• Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem / B. Julstrom, G. Raidl / in: "Proceedings of the 2003 ACM Symposium on Applied Computing, March 9-12, 2003, Melbourne, Florida, USA", ACM, 2003, 747 - 752
• A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem / B. Julstrom, G. Raidl / in: "GECCO - 2003, Genetic and Evolutionary Computation Conference Workshop Program, Workshop on Analysis and Design of Representations and Operators (ADoRo 2003)", A. Barry (ed.); University of Bath, 2003, 2 - 7
• Hybrid Evolutionary Algorithms for Combinatorial Optimization / Habilitation Thesis by G. Raidl / Technische Universität Wien, 2003

2002

• Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem / G. Raidl, I. Ljubic / Information Processing Letters, 82 (2002), 39 - 45
• Letting Ants Labeling Point Features / M. Schreyer, G. Raidl / in: "2002 IEEE Congress on Evolutionary Computation", IEEE, 2002, 1564 - 1569
• On Weight-Biased Mutation for Graph Problems / G. Raidl, G. Kodydek, B. Julstrom / in: "Parallel Problem Solving from Nature-PPSNVII", Springer, 2002, 204 - 213
• A Memetic Algorithm for Vertex-Biconnectivity Augmentation / S. Kersting, G. Raidl, I. Ljubic / in: "Applications of Evolutionary Computing", Springer, 2002, 102 - 111
• Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges / B. Julstrom, G. Raidl / in: "Applied Computing 2002", ACM, New York, 2002, 547 - 552

2021

• Advances in Search Techniques for Combinatorial Optimization: New Anytime A* Search and Decision Diagram Based Approaches / Doctoral Thesis by M. Horn / Supervisor, Reviewer: G. Raidl, C. Blum, L. Di Gaspero; Institute of Logic and Computation, 2021; oral examination: 2021-09-09
• Exact and Heuristic Approaches for Solving String Problems from Bioinformatics / Doctoral Thesis by M. Djukanovic / Supervisor, Reviewer: G. Raidl, C. Blum; Institute of Logic and Computation, 2021; oral examination: 2021-05-05

2020

• Casual Employee Scheduling with Constraint Programming and Metaheuristics / Master Thesis by S. Teuschl / Supervisor: G. Raidl, N. Frohner; Institute of Logic and Computation, 2020; final examination: 2020-11
• Solving a Generalized Constrained Longest Common Subsequence Problem / Master Thesis by C. Berger / Supervisor: G. Raidl, M. Djukanovic; Institute of Logic and Computation, 2020; final examination: 2020-06
• Combinatorial Optimization Approaches for Graph Construction Problems / Doctoral Thesis by B. Klocker / Supervisor, Reviewer: G. Raidl, H. Fleischner; Institute of Logic and Computation, 2020; oral examination: 2020-03-25
• Heuristische Optimierungsverfahren für die Koordinierung von Flughafenslots / Master Thesis by S. Kuran / Supervisor: G. Raidl, A Chwatal; Institute of Logic and Computation, 2020; final examination: 2020-03

2019

• Patient scheduling in particle therapy / Doctoral Thesis by J. Maschler / Supervisor, Reviewer: G. Raidl, L. Di Gaspero, N. Musliu; Institute of Logic and Computation, 2019; oral examination: 2019-03-20
• A Heuristic Approach to Aircraft Trajectory Optimization with Constraints / Master Thesis by A. Windbichler / Supervisor: G. Raidl; Institute of Logic and Computation, 2019; final examination: 2019-03-13
• Algorithmic approaches for Optimization problems in bike sharing and security control / Doctoral Thesis by C. Kloimüllner / Supervisor, Reviewer: G. Raidl, K. Sörensen, N. Musliu; Institute of Logic and Computation, 2019; oral examination: 2019-01-31

2016

• A Hybrid Evolutionary Algorithm for the Vehicle Routing Problem with Stochastic Demands / Master Thesis by S. Pourmanouchehri / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-09-01
• Complete Solution Archives for Evolutionary Combinatorial Optimization / Doctoral Thesis by B. Biesinger / Supervisor, Reviewer: G. Raidl, C. Blum, U. Pferschy; Institut für Computergraphik und Algorithmen, 2016; oral examination: 2016-06-03
• Metaheuristics for the Districting and Routing Problem for Security Control / Master Thesis by M. Prischink / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-05-09
• Column Generation at Strip Level for the K-Staged Two-Dimensional Cutting Stock Problem / Master Thesis by F. Leberl / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-03-22
• Visibility-Based Obstacle Placing / Master Thesis by C. Schwab / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-02-11
• A Branch-and-Bound Approach for the Constrained K-Staged 2-Dimensional Cutting Stock Problem / Master Thesis by B. Bonigl / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-02-11

2015

• Optimierung von elektro-hybriden Antriebskonzepten mittels heuristischer Optimierungsverfahren / Doctoral Thesis by T. Krenek / Supervisor, Reviewer: T. Lauer, G. Raidl; Institut für Fahrzeugantriebe und Automobiltechnik, 2015; oral examination: 2015-09-07
• Optimierungsansätze zur Planung von Freizeit-Fahrradrouten / Master Thesis by B. Klocker / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2015; final examination: 2015-04

2014

• Heuristic solution approaches for the two dimensional pre-marshalling problem. / Master Thesis by A. Tus / Supervisor: G. Raidl, A. Rendl; Institut für Computergrafik und Algorithmen, 2014
• Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework. / Master Thesis by P. Klaffenböck / Supervisor: G. Raidl; Institut für Computergrafik und Algorithmen, 2014
• A hybrid algorithm for the partition coloring problem. / Master Thesis by G. Fritz / Supervisor: G. Raidl, B. Hu; Computergraphik und Algorithmen, 2014
• Finding longest common subsequences by GPU-based parallel ant colony optimization. / Master Thesis by D. Markvica / Supervisor: G. Raidl; Computergraphik und Algorithmen, 2014
• Applying ant colony optimization to the periodic vehicle routing problem with time windows. / Master Thesis by D. Trummer / Supervisor: G. Raidl; Computergraphik und Algorithmen, 2014

2013

• Balancing bike sharing systems / Master Thesis by A. Pinter / Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-12
• Two-phase local search for the bi-objective connected facility location problem / Master Thesis by T. Petelin / Supervisor: G. Raidl, M. Leitner; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-12
• The rooted delay-constrained steiner tree problem with uncertain delays / Master Thesis by R. Karl / Supervisor: G. Raidl, M. Leitner, M. Ruthmair; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-12
• Optimization Challenges of the Future Federated Internet / Doctoral Thesis by J. Inführ / Supervisor, Reviewer: G. Raidl, K. Tutschku; Institut für Computergraphik and Algorithmen, 2013; oral examination: 2013-11-27
• Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems / Master Thesis by M. Putzenlechner / Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-08
• Metaheuristic optimization of electro-hybrid powertrains using machine learning techniques / Master Thesis by C. Bacher / Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-08
• Selective Graph Coloring Problem / Master Thesis by C. Volko / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-04
• Critical Links Detection using CUDA / Master Thesis by T. Schnabl / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-04
• Metaheuristics for the regenerator location problem / Master Thesis by P. Jahrmann / Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-03

2012

• Extending the gecode framework with interval constraint programming / Master Thesis by I. Ivezic / Supervisor: G. Raidl, L. Di Gaspero; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-10
• The vehicle routing problem with compartments / Master Thesis by P. Gebhard / Supervisor: G. Raidl, S. Pirkwieser; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-10
• Improving the protein identification performance in high-resolution mass spectrometry data / Master Thesis by F. Dusberger / Supervisor: G. Raidl, K. Mechtler, P. Pichler; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-10
• Solving multimodal resource constrained project scheduling problems / Master Thesis by M. Sturm / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-09
• On Solving Constrained Tree Problems and an Adaptive Layers Framework / Doctoral Thesis by M. Ruthmair / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2012; oral examination: 2012-06-21
• Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation / Doctoral Thesis by S. Pirkwieser / Supervisor, Reviewer: G. Raidl, K. Dörner; Institut für Computergraphik und Algorithmen, 2012; oral examination: 2012-06-14
• Metaheuristics for a multimodal home-health care scheduling problem / Master Thesis by G. Hiermann / Supervisor: G. Raidl, J. Puchinger; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-05
• Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents / Master Thesis by B. Biesinger / Supervisor: G. Raidl, C. Schauer, B. Hu; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-05

2011

• Clustering Heuristics for the Hierarchical Ring Network Problem / Master Thesis by R. Schuster / Supervisor: G. Raidl, C. Schauer; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-11
• A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem / Master Thesis by T. Seidl / Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-09
• Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem / Master Thesis by C. Gruber / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-09
• Heuristic methods for the hop constrained survivable network design problem / Master Thesis by G. Fritz / Supervisor: G. Raidl, M. Leitner; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-09
• Branch-and-price for the Steiner tree problem with revenues, budget and hop constraints / Master Thesis by M. Sinnl / Supervisor: G. Raidl, M. Leitner; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-08
• Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten / Master Thesis by T. Winkler / Supervisor: G. Raidl, C. Schauer; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-07
• Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus / Master Thesis by T. Krenek / Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-07
• Optimierung der periodischen Tourenplanung in der Müllentsorgung / Master Thesis by K. Edlinger / Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-07

2010

• A timeslot-based heuristic approach to construct high-school timetables / Master Thesis by M. Pimmer / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-12
• Ein neues lösungsarchiv für das generalized minimum spanning tree-problem / Master Thesis by M. Sonnleitner / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-09
• Solving the k-node minimum label spanning arborescence problem with exact and heuristic methods / Master Thesis by K. Oberlechner / Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-08
• Automatic generation of 2-antwars players with genetic programming / Master Thesis by J. Inführ / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-07
• Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem / Master Thesis by M. Berlakovich / Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-07
• Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods / Doctoral Thesis by M. Leitner / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2010; oral examination: 2010-06-16
• On the Minimum Label Spanning Tree Problem: Solution Methods and Applications / Doctoral Thesis by A Chwatal / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2010; oral examination: 2010-06-16
• Reconstructing cross-cut shredded documents by means of evolutionary algorithms / Master Thesis by C. Schauer / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-05
• Compressing fingerprint templates by solving the $k$-node minimum label spanning arborescence problem by branch-and-price / Master Thesis by C. Thöni / Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-02
• Heuristic methods for solving two generalized network problems / Master Thesis by A. Pagacz / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-02

2009

• Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem / Doctoral Thesis by M. Gruber / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2009; oral examination: 2009-06-16
• Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenndung in einem Ersatzteillager mit domänenspezifischen Nebenbedingungen / Master Thesis by T. Misar / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-04
• Event based similarity search and its applications in business analytics / Master Thesis by M. Suntinger / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-03
• Similarity searching in complex business events and sequences thereof / Master Thesis by H. Obweger / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-03
• Enhancing a genetic algorithm by a complete solution archive based on a trie data structure / Master Thesis by A. Sramko / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-02
• Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documents / Doctoral Thesis by M. Prandtstetter / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2009
• Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing / Master Thesis by J. Walla / Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2009
• Ein lösungsarchiv-unterstützter evolutionärer algorithmus für das generalized minimum spanning tree-problem / Master Thesis by M. Wolf / Supervisor: G. Raidl, B. Hu; Institute of Computer Graphics and Algorithms, 2009

2008

• Hybrid Metaheuristics for Generalized Network Design Problems / Doctoral Thesis by B. Hu / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2008; oral examination: 2008-12-11
• Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpräferenzen / Master Thesis by U. Rietzinger / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-12
• Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung / Master Thesis by N. Musil / Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-12
• Webbasierte Darstellung großer Datenmengen als pivot-tabelle mithilfe ressourcenoptimierter Aggregationsverfahren / Master Thesis by A. Potocka / Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-10
• Parallel variable neighborhood search for the car sequencing problem / Master Thesis by M. Knausz / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-10
• Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen / Master Thesis by F. Berger / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-09
• A complete archive genetic algorithm for the multidimensional knapsack problem / Master Thesis by S. Zaubzer / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05
• Lagrangian relax-and-cut and hybrid methods for the bounded diameter and the hop constrained minimum spanning tree problems / Master Thesis by F. Zaubzer / Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05
• Evaluation and reconstruction of strip-shredded text documents / Master Thesis by W. Morandell / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05
• Combinatorial Optimization for the Compression of Biometric Templates / Master Thesis by O. Dietzel / Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05
• An incremental dynamic programming approach for multidimensional allocation problems / Master Thesis by C. Bonitz / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05
• Reconstructing borders of manually torn paper scheets using integer linear programming / Master Thesis by P. Schüller / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-01

2007

• Algorithmic Approaches to the String Barcoding Problem / Master Thesis by P. Neuner / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2007; final examination: 2007-10
• Subgradient optimization based lagrangian relaxation and relax-and-cut approaches for the bounded-diameter minimum spanning tree problem / Master Thesis by P. Putz / Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2007; final examination: 2007-10
• Improved Protein Identification After Fast Elimination of Non-Interpretable Peptide MS/MS Spectra and Noise Reduction / Doctoral Thesis by N. Mujezinovic / Supervisor, Reviewer: G. Raidl, F. Eisenhaber; Institut für Computergraphik und Algorithmen, TU Wien, 2007; oral examination: 2007-05
• Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks / Master Thesis by Th. Bucsics / Supervisor: G. Raidl, D. Wagner; Institut für Computergraphik und Algorithmen, TU Wien, 2007; final examination: 2007-03
• Map-Matching und Wegsuche in einem geografischen Informationssystem / Master Thesis by A Braumann / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2007; final examination: 2007-01

2006

• A Lagrangian decomposition approach combined with metaheuristics for the knapsack constrained maximum spanning tree problem. / Master Thesis by S. Pirkwieser / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-10
• Solving two generalized network design problems with exact and heuristic methods. / Master Thesis by M. Leitner / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-05
• Selbstausrichtende Prozesse - Elemente der Künstlichen Intelligenz im Geschäftsmanagement / Doctoral Thesis by R. El-Berry / Supervisor, Reviewer: J. Dorn, G. Raidl; Institut für Informationssysteme, Arbeitsbereich Datenbanker & Artificial Intelligence, 2006
• Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems. / Doctoral Thesis by J. Puchinger / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2006; oral examination: 2006-01
• An ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem. / Master Thesis by B. Kopinitsch / Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-01
• Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen. / Master Thesis by A Chwatal / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-01

2005

• Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem. / Master Thesis by D. Wagner / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2005
• Exact and heuristic methods for solving the car sequencing problem. / Master Thesis by M. Prandtstetter / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2005
• Option pricing by means of genetic programming. / Master Thesis by A. Heigl / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2005
• Multiple structural RNA alignment with affine gap costs based on Lagrangian relaxation. / Master Thesis by V. Gamper / Supervisor: G. Raidl, G.W. Klau; Insitut für Computergraphik und Algorithmen, 2005
• An extended local branching framework and its application to the multidimensional knapsack problem. / Master Thesis by D. Lichtenberger / Supervisor: G. Raidl, J. Puchinger; Institut für Computergraphik und Algorithmen, 2005
• An application of Dijkstra's algorithm for a (on-board) route (re-)planning module. / Master Thesis by G. Verlut / Supervisor: G. Raidl, J. Puchinger; Institut für Computergraphik und Algorithmen, 2005
• Dynamische Reihenfolgeoptimierung mittels Simulation und Meta-Heuristiken. / Master Thesis by D. Fischinger / Supervisor: G. Raidl, W. Stöcher; Institut für Computergraphik und Algorithmen, 2005

2004

• Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problem. / Master Thesis by G. Gruber / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2004
• An alignment graph based evolutionary algorithm for the multiple sequence alignment problem / Master Thesis by S. Leopold / Supervisor: G. Raidl, G. Koller; Institut für Computergraphik und Algorithmen, 2004

2003

• Ein genetischer Algorithmus für das Generalized Assignment Problem / Master Thesis by H. Feltl / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2003
• Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems / Master Thesis by S. Kersting / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2003
• Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem / Master Thesis by J. Fauster / Supervisor: G. Raidl, G. Koller; Institut für Computergraphik und Algorithmen, 2003
• Verfahren zur Lösung eines Glasverschnittproblems / Master Thesis by J. Puchinger / Supervisor: G. Raidl, G. Kodydek; Institut für Computergraphik und Algorithmen - E186, 2003

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