Publikationsliste für
Günther Raidl
als Autorin / Autor bzw. wesentlich beteiligte Person
396 Datensätze (2002 - 2021)
Bücher und Buch-Herausgaben
H. Beyer, G. Raidl et al. (Hrg.):
"GECCO: Genetic And Evolutionary Computation Conference Conference Proceedings";
ACM Press,
2005,
ISBN: 1-59593-038-8;
2229 S.
M. Blesa, C. Blum, G. Raidl, A. Roli, M. Sampels (Hrg.):
"Hybrid Metaheuristics, 7th Int. Workshop, HM 2010";
Springer,
2010,
ISBN: 978-3642160530.
C. Blum, G. Raidl (Hrg.):
"Hybrid Metaheuristics -- Powerful Tools for Optimization";
Springer,
2016,
ISBN: 978-3-319-30883-8;
172 S.
J. Gottlieb, G. Raidl (Hrg.):
"Evolutionary Computation in Combinatorial Optimization - 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006. Proceedings.";
Springer,
Heidelberg,
2006,
ISBN: 978-3-540-33178-0;
293 S.
Zusätzliche Informationen
J. Gottlieb, G. Raidl (Hrg.):
"Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings";
Springer,
Heidelberg,
2004,
ISBN: 3-540-21367-8;
241 S.
H. C. Lau, G. Raidl, P. Van Hentenryck (Hrg.):
"Proceedings of the 10th Metaheuristics International Conference";
Singapore Management University,
Singapore,
2013.
G. Raidl et al. (Hrg.):
"Applications of Evolutionary Computing";
Springer,
LNCS 2611,
2003,
ISBN: 3-540-00976-0;
708 S.
G. Raidl et al. (Hrg.):
"Applications of Evolutionary Computing: EvoWorkshops 2004 - Lecture Notes in Computer Science 3004";
Springer,
Berlin Heidelberg New York,
2004,
ISBN: 3-540-21378-3;
562 S.
G. Raidl et al. (Hrg.):
"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference";
ACM Press,
2009,
ISBN: 978-1-60558-505-5;
1728 S.
G. Raidl, J. Gottlieb (Hrg.):
"Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings (LNCS 3448)";
Springer,
Heidelberg,
2005,
ISBN: 3-540-25337-8;
271 S.
Zusätzliche Informationen
Zeitschriftenartikel
B. Biesinger, B. Hu, G. Raidl:
"A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem";
Journal of Heuristics,
21
(2015),
3;
S. 391
- 431.
Zusätzliche Informationen
B. Biesinger, B. Hu, G. Raidl:
"Models and algorithms for competitive facility location problems with different customer behavior.";
Annals of Mathematics and Artificial Intelligence,
76
(2016),
1;
S. 93
- 119.
Zusätzliche Informationen
C. Blum, M. Djukanovic, A. Santini, H. Jiang, C. Li, F. Manya, G. Raidl:
"Solving longest common subsequence problems via a transformation to the maximum clique problem";
Computers & Operations Research,
125
(2020),
17 S.
Zusätzliche Informationen
C. Blum, J. Puchinger, G. Raidl, A. Roli:
"Hybrid metaheuristics in combinatorial optimization: A survey";
Applied Soft Computing,
Volume 11
(2011),
Issue 6;
S. 4135
- 4151.
Zusätzliche Informationen
C. Blum, G. Raidl:
"Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Problem";
Optimization Letters,
online 07/2015
(2015),
S. 1
- 17.
Zusätzliche Informationen
A Chwatal, G. Raidl:
"Solving the minimum label spanning tree problem by mathematical programming techniques";
Advances in Operations Research,
Volume 2011
(2011).
Zusätzliche Informationen
A Chwatal, G. Raidl, K. Oberlechner:
"Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates.";
Journal of Mathematical Modelling and Algorithms,
Volume 8
(2009),
3;
S. 293
- 334.
Zusätzliche Informationen
M. Djukanovic, C. Berger, G. Raidl, C. Blum:
"An A∗Search Algorithm for the Constrained Longest Common Subsequence Problem";
Information Processing Letters,
166
(2020),
S. 1
- 10.
Zusätzliche Informationen
M. Djukanovic, G. Raidl, C. Blum:
"Anytime algorithms for the longest common palindromic subsequence problem";
Computers & Operations Research,
114
(2020),
20 S.
Zusätzliche Informationen
M. Djukanovic, G. Raidl, C. Blum:
"Finding Longest Common Subsequences: New anytime A search results";
Applied Soft Computing,
95
(2020),
S. 1
- 21.
Zusätzliche Informationen
J. Hetzl, A.M. Foerster, G. Raidl, O. Mittelsten Scheid:
"CyMATE: A new tool for methylation analysis of plant genomic DNA after bisulfite sequencing";
Plant Journal,
51
(2007),
3;
S. 526
- 536.
G. Hiermann, M. Prandtstetter, A. Rendl, J. Puchinger, G. Raidl:
"Metaheuristics for solving a multimodal home-healthcare scheduling problem";
Central European Journal of Operations Research,
May 2013
(2013).
Zusätzliche Informationen
M. Horn, J. Maschler, G. Raidl, E. Rönnberg:
"A*-based construction of decision diagrams for a prize-collecting scheduling problem";
Computers & Operations Research,
126
(2020),
S. 1
- 21.
Zusätzliche Informationen
M. Horn, G. Raidl, C. Blum:
"Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm";
Artificial Intelligence,
277
(2019),
S. 1
- 26.
Zusätzliche Informationen
M. Horn, G. Raidl, E. Rönnberg:
"A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources";
Annals of Operations Research,
82
(2020),
S. 1
- 29.
Zusätzliche Informationen
B. Hu, M. Leitner, G. Raidl:
"Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem";
Journal of Heuristics,
14
(2008),
5;
S. 473
- 499.
B. Hu, M. Leitner, G. Raidl:
"The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search";
Networks,
55
(2010),
3;
S. 257
- 275.
J. Inführ, G. Raidl:
"A Memetic Algorithm for the Virtual Network Mapping Problem.";
Journal of Heuristics (eingeladen),
Dezember 2014
(2014),
S. 1
- 31.
Zusätzliche Informationen
T. Jatschka, G. Raidl, T. Rodemann:
"A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications";
Algorithms,
14
(2021),
8;
S. 1
- 24.
Zusätzliche Informationen
B. Klocker, H. Fleischner, G. Raidl:
"A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three";
Applied Mathematics and Computation,
380
(2020),
S. 1
- 19.
Zusätzliche Informationen
B. Klocker, H. Fleischner, G. Raidl:
"A model for finding transition-minors";
Discrete Applied Mathematics,
283
(2020),
S. 242
- 264.
Zusätzliche Informationen
C. Kloimüllner, G. Raidl:
"Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition";
Networks,
69
(2017),
3;
S. 270
- 289.
Zusätzliche Informationen
T. Krenek, C. Bacher, G. Raidl, T. Lauer:
"Numerical Optimization of Electro Hybrid Powertrains";
MTZ worldwide,
76
(2015),
3;
S. 46
- 52.
Zusätzliche Informationen
T. Krenek, C. Bacher, G. Raidl, T. Lauer:
"Numerische Optimierung elektrifizierter Antriebsstränge";
MTZ - Motortechnische Zeitschrift,
76
(2015),
3;
S. 66
- 74.
Zusätzliche Informationen
H. C. Lau, G. Raidl, P. Van Hentenryck:
"New developments in metaheuristics and their applications";
Journal of Heuristics,
22
(2016),
4;
S. 359
- 363.
M. Leitner, G. Raidl:
"Branch-and-cut-and-price for capacitated connected facility location";
Journal of Mathematical Modelling and Algorithms,
Volume 10
(2011),
Number 3;
S. 245
- 267.
Zusätzliche Informationen
M. Leitner, M. Ruthmair, G. Raidl:
"Stabilizing branch-and-price for constrained tree problems";
Networks,
Volume 61
(2013),
2;
S. 150
- 170.
Zusätzliche Informationen
E. Lizarraga, M. Blesa, C. Blum, G. Raidl:
"Large Neighborhood Search for the Most Strings with Few Bad Columns Problem";
Journal of Heuristics,
21
(2016),
S. 1
- 15.
Zusätzliche Informationen
I. Ljubic, G. Raidl:
"A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs";
Journal of Heuristics,
9
(2003),
S. 401
- 427.
J. Maschler, G. Raidl:
"Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources";
Annals of Operations Research,
302
(2021),
S. 507
- 531.
Zusätzliche Informationen
J. Maschler, G. Raidl:
"Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments";
Journal of Graph Theory,
96
(2018).
Zusätzliche Informationen
N. Mujezinovic, G. Raidl, J. Hutchins, J. Peters, K. Mechtler, F. Eisenhaber:
"Cleaning of raw peptide ms/ms spectra: Improved protein identification following deconvolution of multiply charged peaks, isotope clusters, and removal of background noise.";
Proteomics,
Vol 6
(2006),
19;
S. 5117
- 5131.
Zusätzliche Informationen
B. Nikolic, A. Kartelj, M. Djukanovic, M. Grbic, C. Blum, G. Raidl:
"Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings";
Mathematics,
9
(2021),
S. 1
- 25.
Zusätzliche Informationen
C. Nothegger, A. Mayer, A Chwatal, G. Raidl:
"Solving the post enrolment course timetabling problem by ant colony optimization";
Annals of Operations Research,
Volume 194
(2012),
1;
S. 325
- 339.
Zusätzliche Informationen
P. Pop, S. Cosmin, B. Biesinger, B. Hu, G. Raidl:
"Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm";
Carpathian Journal of Mathematics,
33
(2017),
3;
S. 365
- 371.
Zusätzliche Informationen
M. Prandtstetter, G. Raidl:
"An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem";
European Journal of Operational Research (eingeladen),
191
(2008),
3;
S. 1004
- 1022.
J. Puchinger, G. Raidl:
"Bringing order into the neighborhoods: Relaxation guided variable neighborhood search";
Journal of Heuristics (eingeladen),
14
(2008),
5;
S. 457
- 472.
J. Puchinger, G. Raidl:
"Models and algorithms for three-stage two-dimensional bin packing";
European Journal of Operational Research,
183
(2007),
3;
S. 1304
- 1327.
Zusätzliche Informationen
J. Puchinger, G. Raidl, U. Pferschy:
"The multidimensional knapsack problem: Structure and algorithms";
Informs Journal on Computing,
22
(2010),
2;
S. 250
- 265.
Zusätzliche Informationen
G. Raidl:
"Decomposition based hybrid metaheuristics";
European Journal of Operational Research (eingeladen),
244
(2015),
1;
S. 66
- 76.
Zusätzliche Informationen
G. Raidl, J. Gottlieb:
"Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem.";
Evolutionary Computation,
volume 13
(2005),
number 4;
S. 441
- 475.
Zusätzliche Informationen
G. Raidl, B. Julstrom:
"Edge-Sets: An Effective Evolutionary Coding of Spanning Trees";
IEEE Transactions on Evolutionary Computation,
7
(2003),
3;
S. 225
- 239.
G. Raidl, G. Koller, B. Julstrom:
"Biased Mutation Operators for Subgraph-Selection Problems";
IEEE Transactions on Evolutionary Computation,
Volume 10
(2006),
2;
S. 145
- 156.
G. Raidl, I. Ljubic:
"Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem";
Information Processing Letters,
82
(2002),
S. 39
- 45.
M. Rainer-Harbach, P. Papazek, G. Raidl, B. Hu, C. Kloimüllner:
"PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems.";
Journal of Global Optimization (eingeladen),
April
(2014),
S. 1
- 33.
Zusätzliche Informationen
M. Riedler, T. Jatschka, J. Maschler, G. Raidl:
"An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem";
International Transactions in Operational Research,
8
(2017).
Zusätzliche Informationen
B. Schaden, T. Jatschka, S. Limmer, G. Raidl:
"Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers";
ENERGIES,
14
(2021),
22;
S. 1
- 32.
Zusätzliche Informationen
Buchbeiträge
B. Biesinger, B. Hu, G. Raidl:
"A Memetic Algorithm for Competitive Facility Location Problems";
in: "Business and Consumer Analytics: New Ideas",
Springer,
2019,
ISBN: 978-3-030-06221-7,
S. 637
- 660.
Zusätzliche Informationen
C. Blum, J. Puchinger, G. Raidl, A. Roli:
"Hybrid metaheuristics";
in: "Hybrid Optimization -The Ten Years of CPAIOR",
Springer,
2010,
S. 305
- 336.
M. Gruber, G. Raidl:
"(Meta-)heuristic separation of jump cuts in a branch&cut approach for the bounded diameter minimum spanning tree problem";
in: "Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,volume 10 of Annals of Information Systems",
Springer,
2009,
ISBN: 978-1-4419-1305-0,
S. 209
- 230.
Zusätzliche Informationen
M. Pimmer, G. Raidl:
"A timeslot-filling based heuristic approach to construct high-school timetables";
in: "Advances in Metaheuristics",
Springer,
2013,
ISBN: 978-1-4614-6322-1,
S. 143
- 158.
Zusätzliche Informationen
S. Pirkwieser, G. Raidl, J. Puchinger:
"A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem";
in: "Recent Advances in Evolutionary Computation for Combinatorial Optimization",
Springer,
2008,
S. 69
- 85.
J. Puchinger, G. Raidl, S. Pirkwieser:
"MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics";
in: "Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,Volume 10 of Annals of Information Systems",
Springer,
2009,
ISBN: 978-1441913050,
S. 71
- 102.
G. Raidl, J. Puchinger:
"Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization";
in: "Hybrid Metaheuristics - An Emergent Approach for Combinatorial Optimization, volume 114 of Studies in Computational Intelligence",
Springer,
2008,
S. 31
- 62.
G. Raidl, J. Puchinger, C. Blum:
"Metaheuristic Hybrids";
in: "Handbook of Metaheuristics",
herausgegeben von: Michel Gendreau, Jean Yves Potvin, eds.;
Springer,
2019,
ISBN: 978-3-319-91085-7,
S. 385
- 417.
Zusätzliche Informationen
Beiträge in Tagungsbänden
B. Biesinger, C. Schauer, B. Hu, G. Raidl:
"Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents";
in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1",
Springer,
2013,
ISBN: 978-3-642-53855-1,
S. 380
- 387.
Zusätzliche Informationen
C. Blum, J. Puchinger, G. Raidl, A. Roli:
"A brief survey on hybrid metaheuristics";
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,
S. 3
- 16.
Zusätzliche Informationen
A Chwatal, G. Raidl:
"Determining orbital elements of extrasolar planets by evolution strategies.";
in: "Computer Aided Systems Theory - EUROCAST 2007",
R. Moreno-Díaz (Hrg.);
Springer,
Lecture Notes in Computer Science, Vol. 4739,
2007,
ISBN: 978-3-540-75866-2,
S. 870
- 877.
F. Dusberger, G. Raidl:
"A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem";
in: "Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies",
herausgegeben von: 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,
S. 385
- 391.
Zusätzliche Informationen
A. Expósito, G. Raidl, J. Brito, J. Moreno-Perez:
"GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection";
in: "Computer Aided Systems Theory",
10671;
herausgegeben von: Springer Verlag;
Springer LNCS,
2018,
S. 299
- 306.
Zusätzliche Informationen
N. Frohner, S. Teuschl, G. Raidl:
"Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization";
in: "Eurocast2019-EXTENDED ABSTRACTS",
Universidad de Las Palmas de Gran Canaria,
2019,
ISBN: 978-84-09-09208-6,
S. 78
- 79.
M. Horn, G. Raidl, E. Rönnberg:
"An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows";
in: "Annals of Operations Research",
10479;
Springer,
2018,
S. 235
- 256.
Zusätzliche Informationen
B. Julstrom, G. Raidl:
"A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem";
in: "GECCO - 2003, Genetic and Evolutionary Computation Conference Workshop Program, Workshop on Analysis and Design of Representations and Operators (ADoRo 2003)",
A. Barry (Hrg.);
University of Bath,
2003,
S. 2
- 7.
B. Julstrom, G. Raidl:
"Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem";
in: "Proceedings of the 2003 ACM Symposium on Applied Computing, March 9-12, 2003, Melbourne, Florida, USA",
ACM,
2003,
S. 747
- 752.
B. Julstrom, G. Raidl:
"Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges ";
in: "Applied Computing 2002",
ACM,
New York,
2002,
S. 547
- 552.
S. Kersting, G. Raidl, I. Ljubic:
"A Memetic Algorithm for Vertex-Biconnectivity Augmentation ";
in: "Applications of Evolutionary Computing",
Springer,
2002,
S. 102
- 111.
G.W. Klau, I. Ljubic, A. Moser, P. Mutzel, P. Neuner, U. Pferschy, G. Raidl, R. Weiskircher:
"Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem";
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 (Hrg.);
herausgegeben von: Lecture Notes in Computer Science 3102;
Springer,
2004,
ISBN: 3-540-22343-6,
S. 1304
- 1315.
B. Klocker, G. Raidl:
"Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging";
in: "Computer Aided Systems Theory -- EUROCAST 201",
10671;
herausgegeben von: Springer;
Springer LNCS,
2018,
ISBN: 978-3-319-74727-9,
S. 355
- 363.
Zusätzliche Informationen
G. Koller, G. Raidl:
"An evolutionary algorithm for the maximum weight trace formulation of the multiple sequence alignment problem.";
in: "Parallel Problem Solving from Nature - PPSN VIII",
X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervós (Hrg.);
herausgegeben von: Lecture Notes in Computer Science 3242;
Springer,
Berlin Heidelberg New York,
2004,
ISBN: 3-540-23092-0,
S. 302
- 311.
J. Maschler, M. Riedler, G. Raidl:
"Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments";
in: "Computer Aided Systems Theory - EUROCAST 2017",
herausgegeben von: Springer Verlag;
Springer,
2018,
ISBN: 978-3-319-74717-0,
S. 364
- 372.
Zusätzliche Informationen
A. Pagacz, G. Raidl, S. Zawislak:
"Evolutionary approach to constrained minimum spanning tree problem.";
in: "Evolutionary Computation and Global Optimization 2006, Murzasichle, Poland, 2006.",
J. Arabasa (Hrg.);
Oficyna Wydawnicza Politechniki Warszawskiej,
Murzasichle, Polen,
2006,
ISSN: 0137-2343,
S. 331
- 341.
P. Papazek, G. Raidl, M. Rainer-Harbach, B. Hu:
"A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems";
in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1",
Springer,
2013,
ISBN: 978-3-642-53855-1,
S. 372
- 379.
Zusätzliche Informationen
S. Pirkwieser, G. Raidl, J. Gottlieb:
"Improved packing and routing of vehicles with compartments";
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,
S. 302
- 304.
P. Pop, B. Hu, G. Raidl:
"A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem";
in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1",
Springer,
2013,
ISBN: 978-3-642-53855-1,
S. 219
- 226.
Zusätzliche Informationen
J. Puchinger, G. Raidl:
"An evolutionary algorithm for column generation in integer programming: an effective approach for 2D bin packing. ";
in: "Parallel Problem Solving from Nature - PPSN VIII",
X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervós et al. (Hrg.);
herausgegeben von: Lecture Notes in Computer Science 3242;
Springer,
Berlin Heidelberg New York,
2004,
ISBN: 3-540-23092-0,
S. 642
- 651.
J. Puchinger, G. Raidl, G. Koller:
"Solving a real-world glass cutting problem. ";
in: "Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004",
herausgegeben von: Lecture Notes in Computer Science 3004;
Springer,
Heidelberg,
2004,
ISBN: 3-540-21367-8,
S. 165
- 176.
G. Raidl, H. Feltl:
"An improved hybrid genetic algorithm for the generalized assignment problem.";
in: "Proceedings of the 2003 ACM Symposium on Applied Computing",
H. M. Haddad et al. (Hrg.);
ACM,
2004,
ISBN: 1-58113-812-1,
S. 990
- 995.
G. Raidl, G. Kodydek, B. Julstrom:
"On Weight-Biased Mutation for Graph Problems";
in: "Parallel Problem Solving from Nature-PPSNVII",
Springer,
2002,
S. 204
- 213.
M. Schreyer, G. Raidl:
"Letting Ants Labeling Point Features";
in: "2002 IEEE Congress on Evolutionary Computation",
IEEE,
2002,
S. 1564
- 1569.
Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag)
C. Bacher, T. Krenek, G. Raidl:
"Reducing the number of simulations in operation strategy optimization for hybrid electric vehicles.";
Vortrag: 17th European Conference, EvoApplications 2014,
Granada, Spanien;
23.04.2014
- 25.04.2014; in: "Applications of Evolutionary Computation, Lecture Notes in Computer Science",
A. Esparcia-Alcázar, A. Mora (Hrg.);
Springer Berlin Heidelberg,
(2014),
ISBN: 978-3-662-45522-7;
S. 553
- 564.
Zusätzliche Informationen
C. Bacher, G. Raidl:
"A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles";
Vortrag: Eurocast 2015,
Gran Canaria, Spain;
08.02.2015
- 13.02.2015; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory",
A. Quesada-Arencibia (Hrg.);
(2015),
ISBN: 978-84-606-5438-4;
S. 119
- 120.
M. Berlakovich, M. Ruthmair, G. Raidl:
"A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory",
(2011),
ISBN: 978-84-693-9560-8;
S. 247
- 249.
M. Berlakovich, M. Ruthmair, G. Raidl:
"A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I",
volume 6927 of LNCS
(2012),
ISBN: 978-3642275487;
S. 256
- 263.
Zusätzliche Informationen
B. Biesinger, B. Hu, G. Raidl:
"A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands";
Vortrag: Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015,
Kopenhagen, Dänemark;
08.04.2015
- 10.04.2015; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015",
G. Ochoa, F. Chicano (Hrg.);
Springer,
9026
(2015),
ISBN: 978-3-319-16467-0;
S. 48
- 60.
Zusätzliche Informationen
B. Biesinger, B. Hu, G. Raidl:
"An evolutionary algorithm for the leader-follower facility location problem with proportional customer behavior.";
Vortrag: Learning and Intelligent OptimizatioN Conference LION,
Gainesville;
16.02.2014
- 21.02.2014; in: "Learning and Intelligent Optimization",
P. Pardalos, M. Resende, C. Vogiatzis, J. Walteros (Hrg.);
(2014),
ISBN: 978-3-319-09584-4;
S. 203
- 217.
Zusätzliche Informationen
B. Biesinger, B. Hu, G. Raidl:
"An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands";
Vortrag: International Network Optimization Conference (INOC),
Warschau, Polen;
18.05.2015
- 20.05.2015; in: "Proceedings of the 7th International Network Optimization Conference",
Electronic Notes in Discrete Mathematics,
52
(2016),
ISSN: 1571-0653;
S. 245
- 252.
Zusätzliche Informationen
B. Biesinger, C. Schauer, B. Hu, G. Raidl:
"Reconstructing cross cut shredded documents with a genetic algorithm with solution archive";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spanien;
10.02.2013
- 15.02.2013; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory",
(2013),
ISBN: 978-84-695-6971-9;
S. 226
- 228.
B. Biesinger, C. Weiler, B. Hu, G. Raidl:
"Heuristic Approaches for the Probabilistic Traveling Salesman Problem";
Vortrag: Eurocast 2015,
Gran Canaria, Spain;
08.02.2015
- 13.02.2015; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory",
A. Quesada-Arencibia (Hrg.);
(2015),
ISBN: 978-84-606-5438-4;
S. 99
- 100.
S. Biffl, R. Mordinyi, G. Raidl, H. Steininger, D. Winkler:
"An SME Transition from Plan-Driven to Hybrid Project Management with Agile Software Development Methods";
Vortrag: 21th EuroSPI Conference on Systems Software and Service Process Improvement, Industrial Track,
Luxembourg, Luxemburg;
25.06.2014
- 27.06.2014; in: "Proceedings of the 21th EuroSPI Conference on Systems Software and Service Process Improvement, Industrial Track",
Delta,
(2014),
ISBN: 978-87-7398-157-3.
Zusätzliche Informationen
C. Blum, D. Thiruvady, A. Ernst, M. Horn, G. Raidl:
"A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem";
Vortrag: Advances in Artificial Intelligence,
North Terrace, Adelaide, South Australia;
02.12.2019
- 05.12.2019; in: "AI 2019: Advances in Artificial Intelligence",
LNCS,
11919
(2019),
ISBN: 978-3-030-35288-2;
S. 549
- 560.
Zusätzliche Informationen
A. Bracher, N. Frohner, G. Raidl:
"Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems";
Vortrag: CPAIOR 2021 - 18th International Conference of Integration of Constraint Programming, Artificial Intelligence, and Operations Research,
Wien;
05.07.2021
- 08.07.2021; in: "Integration of Constraint Programming, Artificial Intelligence, and Operations Research",
LNCS / Springer,
12735
(2021),
ISBN: 978-3-030-78229-0;
S. 283
- 298.
Zusätzliche Informationen
A Chwatal, N. Musil, G. Raidl:
"Solving a multi-constrained network design problem by lagrangean decomposition and column generation";
Vortrag: International Network Optimization Conference (INOC),
Pisa;
26.04.2009
- 29.04.2009; in: "Proceedings of the International Network Optimization Conference 2009",
(2009),
7 S.
Zusätzliche Informationen
A Chwatal, G. Raidl:
"Determining orbital elements of extrasolar planets by evolution strategies.";
Vortrag: 11th International Conference on Computer Aided Systems Theory (EUROCAST),
Las Palmas de Gran Canaria, Spanien;
12.02.2007
- 16.02.2007; in: "EUROCAST 2007 Conference Proceedings, 2007",
R. Moreno-Díaz (Hrg.);
(2007).
A Chwatal, G. Raidl:
"Fitting rectangular signals to time series data by metaheuristic algorithms";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria;
15.02.2009
- 20.02.2009; in: "Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)",
(2009),
S. 222
- 225.
Zusätzliche Informationen
A Chwatal, G. Raidl:
"Solving the minimum label spanning tree problem by ant colony optimization";
Vortrag: Conference on Genetic and Evolutionary Methods (GEM),
Las Vegas, Nevada, USA;
12.07.2010
- 15.07.2010; in: "Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods",
(2010),
S. 91
- 97.
Zusätzliche Informationen
A Chwatal, G. Raidl, O. Dietzel:
"Compressing fingerprint templates by solving an extended minimum label spanning tree problem.";
Vortrag: MIC 2007: The Seventh Metaheuristics International Conference,
Montréal, Canada;
25.06.2007
- 29.06.2007; in: "Proceedings of the Seventh Metaheuristics International Conference (MIC)",
(2007),
3 S.
A Chwatal, G. Raidl, M. Zöch:
"Fitting multi-planet transit models to photometric time-data series by evolution strategies";
Vortrag: GECCO: Genetic and Evolutionary Computation Conference,
Portland, Oregon, USA;
07.07.2010
- 11.07.2010; in: "Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation",
(2010),
7 S.
Zusätzliche Informationen
A Chwatal, C. Thöni, K. Oberlechner, G. Raidl:
"A branch-and-cut-and-price algorithm for a fingerprint-template compression application";
Poster: Federated Conference on Computer Science and Information Systems (FedCSIS),
Szczecin, Poland;
18.09.2011
- 21.09.2011; in: "Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS)",
(2011),
S. 239
- 246.
M. Djukanovic, C. Berger, G. Raidl, C. Blum:
"On Solving a Generalized Constrained Longest Common Subsequence Problem";
Vortrag: International Conference on Optimization and Applications,
Moscow, Russia;
28.09.2020
- 02.10.2020; in: "International Conference on Optimization and Applications-OPTIMA2020",
LNCS / Springer,
12422
(2020),
ISBN: 978-3-030-62866-6;
S. 55
- 70.
Zusätzliche Informationen
M. Djukanovic, G. Raidl, C. Blum:
"A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation";
Vortrag: International Conference on Machine Learning, Optimization, and Data Science,
Certosa di Pontignano, Siena, Italy;
10.09.2019
- 13.09.2019; in: "Machine Learning, Optimization, and Data Science",
LNCS,
11943
(2020),
ISBN: 978-3-030-37598-0;
S. 154
- 167.
Zusätzliche Informationen
M. Djukanovic, G. Raidl, C. Blum:
"A Heuristic Approach for Solving the Longest Common Square Subsequence Problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Las Palmas de Gran Canaria, Spain;
17.02.2019
- 22.02.2019; in: "EXTENDED ABSTRACTS-Computer Aided Systems Theory 2019",
IUCTC Universidad de Las Palmas de Gran Canaria,
(2019),
ISBN: 978-84-09-09208-6;
S. 120
- 122.
Zusätzliche Informationen
F. Dusberger, G. Raidl:
"A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size";
Vortrag: Eurocast 2015,
Gran Canaria, Spain;
08.02.2015
- 13.02.2015; 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 (Hrg.);
(2015),
ISBN: 978-84-606-5438-4;
S. 109
- 110.
F. Dusberger, G. Raidl:
"A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem.";
Vortrag: International Workshop on Hybrid Metaheuristics 2014 - HM 2014,
Hamburg;
11.06.2014
- 13.06.2014; in: "Hybrid Metaheuristics, 9th Int. Workshop, HM 2014",
M. Blesa, C. Blum, S. Voß (Hrg.);
LNCS / Springer,
8457
(2014),
ISSN: 0302-9743;
S. 85
- 99.
Zusätzliche Informationen
F. Dusberger, G. Raidl:
"Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search.";
Vortrag: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search,
Djerba, Tunesien;
08.10.2014
- 11.10.2014; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search",
B. Jarboui, A. Sifaleras, A. Rebai (Hrg.);
Elsevier Electronic Notes in Discrete Mathematics,
47
(2015),
S. 133
- 140.
Zusätzliche Informationen
A. Exposit, G. Raidl, J. Brito, J. Moreno-Perez:
"GRASP and VNS for a periodic VRP with time windows to deal with milk collection";
Vortrag: Computer Aided Systems Theory - EUROCAST 2017,
Spain;
19.02.2017
- 24.02.2017; in: "Computer Aided Systems Theory - EUROCAST 2017",
(2017),
S. 90
- 91.
N. Frohner, M. Horn, G. Raidl:
"Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines";
Vortrag: International Conference on Industry 4.0 and Smart Manufacturing,
virtual event;
23.11.2020
- 25.11.2020; in: "Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020)",
Elsevier,
180
(2020),
ISSN: 1877-0509;
S. 366
- 370.
Zusätzliche Informationen
N. Frohner, B. Neumann, G. Raidl:
"A Beam Search Approach to the Traveling Tournament Problem";
Vortrag: Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Sevilla, Spain;
15.04.2020
- 17.04.2020; in: "EvoCOP 2020: Evolutionary Computation in Combinatorial Optimization",
LNCS,
12102
(2020),
ISBN: 978-3-030-43680-3;
S. 67
- 82.
Zusätzliche Informationen
N. Frohner, G. Raidl:
"A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility";
Vortrag: International Conference of the Practice and Theory of Automated Timetabling (PATAT),
Bruges, Belgium;
25.08.2020
- 29.08.2020; in: "Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling",
(2020),
ISBN: 978-0-9929984-3-1;
S. 58
- 76.
Zusätzliche Informationen
N. Frohner, G. Raidl:
"Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers";
Vortrag: International Conference on Machine Learning, Optimization, and Data Science,
Siena, Italy;
10.09.2019
- 13.09.2019; in: "Machine Learning, Optimization, and Data Science",
LNCS,
11943
(2020),
ISBN: 978-3-030-37599-7;
S. 445
- 457.
Zusätzliche Informationen
N. Frohner, G. Raidl:
"Towards Improving Merging Heuristicsfor Binary Decision Diagrams";
Vortrag: Learning and Intelligent OptimizatioN Conference LION,
Chania, Greece;
27.05.2019
- 31.05.2019; in: "LION 2019: Learning and Intelligent Optimization",
LNCS,
11968
(2020),
ISBN: 978-3-030-38628-3;
S. 30
- 45.
Zusätzliche Informationen
N. Frohner, S. Teuschl, G. Raidl:
"Casual Employee Scheduling with Constraint Programming and Metaheuristics";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Las Palmas de Gran Canaria, Spain;
17.02.2019
- 22.02.2019; in: "EUROCAST 2019: Computer Aided Systems Theory - EUROCAST 2019",
LNCS,
12013
(2019),
ISBN: 978-3-030-45092-2;
S. 279
- 287.
Zusätzliche Informationen
M. Gruber, G. Raidl:
"(Meta-)heuristic separation of jump cuts for the bounded diameter minimum spanning tree problem";
Vortrag: Matheuristics2008 - Second International Workshop on Model Based Metaheuristics,
Bertinoro, Italien;
16.06.2008
- 18.06.2008; in: "Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics",
(2008).
M. Gruber, G. Raidl:
"A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem.";
Vortrag: INOC 2005 (2nd International Network Optimization Conference),
Lissabon, Portugal;
20.03.2005
- 23.03.2005; in: "Proceedings of the 2nd International Network Optimization Conference",
Volume 1
(2005),
ISSN: 1762-5734;
S. 178
- 185.
M. Gruber, G. Raidl:
"Cluster-based (meta-)heuristics for the Euclidean bounded diameter minimum spanning tree problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria;
15.02.2009
- 20.02.2009; in: "Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)",
(2009),
S. 228
- 231.
M. Gruber, G. Raidl:
"Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on Euclidean instances";
Vortrag: GECCO: Genetic and Evolutionary Computation Conference,
Montreal, Kanada;
08.07.2009
- 12.07.2009; in: "Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation",
(2009),
8 S.
Zusätzliche Informationen
M. Gruber, G. Raidl:
"Heuristic cut separation in a branch&cut approach for the bounded diameter minimum spanning tree problem";
Vortrag: 2008 International Symposium on Applications and the Internet SAINT 2008,
Turku, Finland;
28.07.2008
- 01.08.2008; in: "Proceedings of the 2008 International Symposium on Applications and the Internet",
IEEE Computer Society,
(2008),
ISBN: 978-0-7695-3297-4;
S. 261
- 264.
M. Gruber, G. Raidl:
"Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Las Palmas de Gran Canaria, Spanien;
15.02.2009
- 20.02.2009; in: "Computer Aided Systems Theory - EUROCAST 2009, 12th International Conference on Computer Aided Systems Theory",
(2009),
ISBN: 978-3-642-04771-8;
S. 665
- 672.
Zusätzliche Informationen
M. Gruber, G. Raidl:
"Variable neighborhood search for the bounded diameter minimum spanning tree problem.";
Vortrag: MECVNS 2005 (XVIII Mini EURO Conference on VNS),
Teneriffa, Spanien;
23.11.2005
- 25.11.2005; in: "Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search",
P. Hansen et al. (Hrg.);
(2005),
ISBN: 84-689-5679-1.
M. Gruber, J van Hemert, G. Raidl:
"Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO.";
Vortrag: GECCO: Genetic and Evolutionary Computation Conference,
Seattle;
08.07.2006
- 12.07.2006; in: "Proceedings of the Genetic and Evolutionary Computation Conference - GECCO 2006",
M. Keijzer et al. (Hrg.);
New York
(2006),
ISBN: 1-59593-186-4;
S. 1187
- 1194.
Zusätzliche Informationen
I. Grujicic, G. Raidl, A. Schöbel:
"Variable neighbourhood search for integrated timetable design of railway infrastructure.";
Vortrag: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search,
Djerba, Tunesien;
08.10.2014
- 11.10.2014; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search",
B. Jarboui, A. Sifaleras, A. Rebai (Hrg.);
Elsevier Electronic Notes in Discrete Mathematics,
47
(2015),
S. 141
- 148.
Zusätzliche Informationen
I. Grujicic, G. Raidl, A. Schöbel, G. Besau:
"A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure";
Vortrag: 3rd International Conference on Road and Rail Infrastructure CETRA 2014,
Split/HR;
28.04.2014
- 30.04.2014; in: "Road and Rail Infrastructure III, Proceedings of the Conference CETRA 2014",
S. Lakusic (Hrg.);
Department of Transportation, University of Zagreb,
Zagreb/HR
(2014),
ISSN: 1848-9842;
S. 691
- 696.
Zusätzliche Informationen
I. Grujicic, G. Raidl, A. Schöbel, G. Besau:
"A metaheuristic approach for integrated timetable based design of railway infrastructure";
Vortrag: CETRA 2014,
Split;
28.04.2014
- 30.04.2014; in: "Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA 2014",
S. Lakusic (Hrg.);
(2014),
ISSN: 1848-9850;
S. 691
- 696.
Zusätzliche Informationen
M. Horn, M. Djukanovic, C. Blum, G. Raidl:
"On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences";
Vortrag: International Conference Optimization and Applications,
Moscow, Russia;
28.09.2020
- 02.10.2020; in: "Optimization and Applications",
LNCS / Springer,
12422
(2020),
ISBN: 978-3-030-62866-6;
S. 134
- 149.
Zusätzliche Informationen
M. Horn, N. Frohner, G. Raidl:
"Driver Shift Planning for an Online Store with Short Delivery Times";
Vortrag: International Conference on Industry 4.0 and Smart Manufacturing,
virtual event;
17.11.2021
- 19.11.2021; in: "Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing",
Elsevier,
180
(2021),
ISSN: 1877-0509;
S. 517
- 524.
Zusätzliche Informationen
M. Horn, G. Raidl:
"A∗-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem";
Vortrag: CPAIOR 2021 - 18th International Conference of Integration of Constraint Programming, Artificial Intelligence, and Operations Research,
Wien;
05.07.2021
- 08.07.2021; in: "International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research",
LNCS / Springer,
12735
(2021),
ISBN: 978-3-030-78229-0;
S. 72
- 88.
Zusätzliche Informationen
M. Horn, G. Raidl:
"Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Las Palmas de Gran Canaria, Spain;
17.02.2019
- 22.02.2019; in: "Computer Aided System Theory - EUROCAST 2019",
(2019),
ISBN: 978-84-09-09208-6;
S. 94
- 95.
Zusätzliche Informationen
M. Horn, G. Raidl, C. Blum:
"Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment";
Vortrag: International Workshop on Machine Learning, Optimization, and Big Data,
Volterra, Italy;
14.09.2017
- 17.09.2017; in: "MOD 2017: Machine Learning, Optimization, and Big Data - Third International Conference",
LNCS,
10710
(2017),
ISBN: 978-3-319-72925-1;
S. 506
- 518.
Zusätzliche Informationen
B. Hu, M. Leitner, G. Raidl:
"Computing generalized minimum spanning trees with variable neighborhood search.";
Vortrag: MECVNS 2005 (XVIII Mini EURO Conference on VNS),
Teneriffa, Spanien;
23.11.2005
- 25.11.2005; in: "Proceedings of the XVIII Mini EURO Conference on VNS",
P. Hansen et al. (Hrg.);
(2005),
ISBN: 84-689-5679-1.
B. Hu, W. Ölz, G. Raidl:
"A mixed integer model for the stamina-aware sightseeing tour problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spanien;
10.02.2013
- 15.02.2013; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory",
(2013),
ISBN: 978-84-695-6971-9;
S. 200
- 202.
B. Hu, G. Raidl:
"A memetic algorithm for the generalized minimum vertex-biconnected network problem";
Vortrag: Conference on Hybrid Intelligent Systems - HIS,
Shenyang, China;
12.08.2009
- 14.08.2009; in: "9th International Conference on Hybrid Intelligent Systems - HIS 2009",
(2009),
6 S.
Zusätzliche Informationen
B. Hu, G. Raidl:
"An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory",
(2011),
ISBN: 978-84-693-9560-8;
S. 256
- 258.
Zusätzliche Informationen
B. Hu, G. Raidl:
"An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I",
volume 6927 of LNCS
(2012),
ISBN: 978-3642275487;
S. 287
- 294.
Zusätzliche Informationen
B. Hu, G. Raidl:
"An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem";
Vortrag: GECCO: Genetic and Evolutionary Computation Conference,
Philadelphia, USA;
07.07.2012
- 11.07.2012; in: "Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation",
(2012),
S. 393
- 400.
Zusätzliche Informationen
B. Hu, G. Raidl:
"Effective neighborhood structures for the generalized traveling salesman problem";
Vortrag: 8th European Conference, EvoCOP 2008,
Naples, Italy;
26.03.2008
- 28.03.2008; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2008",
LNCS/Springer Berlin,
4972/2008/ Heidelberg
(2008),
ISSN: 0302-9743;
S. 36
- 47.
B. Hu, G. Raidl:
"Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem";
Vortrag: Conference on Hybrid Intelligent Systems - HIS,
Barcelona, Spanien;
10.09.2008
- 12.09.2008; in: "8th International Conference on Hybrid Intelligent Systems",
(2008),
S. 73
- 77.
B. Hu, G. Raidl:
"Variable neighborhood descent with self-adaptive neighborhood-ordering.";
Vortrag: 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics,
Malaga;
16.11.2006
- 17.11.2006; in: "Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics",
C. Cotta, A. Fernandez, J. Gallardo (Hrg.);
Malaga, Spanien
(2006).
B. Hu, A. Windbichler, G. Raidl:
"A New Solution Representation for the Firefighter Problem";
Vortrag: Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015,
Kopenhagen, Dänemark;
08.04.2015
- 10.04.2015; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015",
G. Ochoa, F. Chicano (Hrg.);
9026
(2015),
ISBN: 978-3-319-16467-0;
S. 25
- 35.
Zusätzliche Informationen
J. Inführ, G. Raidl:
"A memetic algorithm for the virtual network mapping problem";
Vortrag: Metaheuristics International Conference (MIC),
Singapore;
05.08.2013
- 08.08.2013; in: "Proceedings of the 10th Metaheuristics International Conference",
(2013),
Paper-Nr. 28,
10 S.
Zusätzliche Informationen
J. Inführ, G. Raidl:
"Automatic generation of 2-AntWars players with Genetic Programming";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory",
(2011),
ISBN: 978-84-693-9560-8;
S. 244
- 246.
Zusätzliche Informationen
J. Inführ, G. Raidl:
"Automatic generation of 2-antwars players with genetic programming";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I",
volume 6927 of LNCS
(2012),
ISBN: 978-3642275487;
S. 248
- 255.
Zusätzliche Informationen
J. Inführ, G. Raidl:
"GRASP and variable neighborhood search for the virtual network mapping problem";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Ischia, Italien;
23.05.2013
- 25.05.2013; in: "Hybrid Metaheuristics, 8th Int. Workshop, HM 2013",
Lecture Notes in Computer Science,
Volume 7919
(2013),
ISBN: 978-3-642-38515-5;
S. 159
- 173.
Zusätzliche Informationen
J. Inführ, G. Raidl:
"Introducing the virtual network mapping problem with delay, routing and location constraints";
Vortrag: International Network Optimization Conference (INOC),
Hamburg, Deutschland;
13.06.2011
- 16.06.2011; in: "Network Optimization: 5th International Conference",
(2011),
ISBN: 978-3642215261;
S. 105
- 117.
Zusätzliche Informationen
J. Inführ, G. Raidl:
"Solving the virtual network mapping problem with construction heuristics, local search and variable neighborhood descent";
Vortrag: Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Wien;
03.04.2013
- 05.04.2013; 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;
S. 250
- 261.
Zusätzliche Informationen
J. Inführ, D. Stezenbach, M. Hartmann, K. Tutschku, G. Raidl:
"Using optimized virtual network embedding for network dimensioning";
Vortrag: International Conference on Networked Systems, NetSys 2013,
Stuttgart, Germany;
11.03.2013
- 15.03.2013; in: "Proceedings of Networked Systems 2013",
IEEE Computer Society,
(2013),
ISBN: 978-0-7695-4950-7;
S. 118
- 125.
Zusätzliche Informationen
P. Jahrmann, G. Raidl:
"Clique and independent set based grasp approaches for the regenerator location problem";
Vortrag: Metaheuristics International Conference (MIC),
Singapore;
05.08.2013
- 08.08.2013; in: "Proceedings of the 10th Metaheuristics International Conference",
(2013),
S. 1
- 10.
Zusätzliche Informationen
T. Jatschka, T. Rodemann, G. Raidl:
"A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications";
Vortrag: Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Leipzig, Germany;
24.04.2019
- 26.04.2019; in: "Evolutionary Computation in Combinatorial Optimization 2019",
Lecture Notes in Computer Science,
11452
(2019),
ISBN: 978-3-030-16711-0;
S. 1
- 16.
Zusätzliche Informationen
T. Jatschka, T. Rodemann, G. Raidl:
"Distributing Battery Swapping Stations for Electric Scooters in an Urban Area";
Vortrag: International Conference Optimization and Applications,
Moscow, Russia;
28.09.2020
- 02.10.2020; in: "Optimization and Applications",
LNCS / Springer,
12422
(2020),
ISBN: 978-3-030-62867-3;
S. 150
- 165.
Zusätzliche Informationen
T. Jatschka, T. Rodemann, G. Raidl:
"Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications";
Vortrag: International Conference on Machine Learning, Optimization, and Data Science,
Certosa di Pontignano, Siena, Italy;
10.09.2019
- 13.09.2019; in: "Machine Learning, Optimization, and Data Science",
Lecture Notes in Computer Science,
11943
(2019),
ISBN: 978-3-030-37599-7;
S. 738
- 750.
Zusätzliche Informationen
T. Jatschka, T. Rodemann, G. Raidl:
"VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Las Palmas de Gran Canaria, Spain;
17.02.2019
- 22.02.2019; in: "EXTENDED ABSTRACTS-Computer Aided Systems Theory 2019",
IUCTC Universidad de Las Palmas de Gran Canaria,
(2019),
ISBN: 978-84-09-09208-6;
S. 70
- 71.
Zusätzliche Informationen
T. Jatschka, T. Rodemann, G. Raidl:
"VNS and PBIG as Optimization Cores in aCooperative Optimization Approach forDistributing Service Points";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
lLas Palmas de Gran Canaria, Spain;
17.02.2019
- 22.02.2019; in: "Computer Aided Systems Theory - EUROCAST 2019",
LNCS,
12013
(2020),
ISBN: 978-3-030-45092-2;
S. 255
- 262.
Zusätzliche Informationen
Th. Kaufmann, M. Horn, G. Raidl:
"A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem";
Vortrag: International Conference on Parallel Problem Solving From Nature (PPSN),
Leiden, The Netherlands;
05.09.2020
- 09.09.2020; in: "Parallel Problem Solving from Nature - PPSN XVI",
LNCS / Springer,
12270
(2020),
ISBN: 978-3-030-58115-2;
S. 385
- 398.
Zusätzliche Informationen
B. Klocker, H. Fleischner, G. Raidl:
"A SAT Approach for Finding Sup-Transition-Minors";
Vortrag: Learning and Intelligent OptimizatioN Conference LION,
Chania, Crete, Greece;
27.05.2019
- 31.05.2019; in: "Learning and Intelligent Optimization",
LNCS,
11968
(2019),
ISBN: 978-3-030-38628-3;
S. 325
- 341.
Zusätzliche Informationen
B. Klocker, H. Fleischner, G. Raidl:
"Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Plymouth, United Kingdom;
08.06.2016
- 10.06.2016; in: "Hybrid Metaheuristics - 10th International Workshop on Hybrid Metaheuristics",
LNCS,
9668
(2016),
ISBN: 978-3-319-39635-4;
S. 87
- 103.
Zusätzliche Informationen
C. Kloimüllner, P. Papazek, B. Hu, G. Raidl:
"Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case.";
Vortrag: Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Granada;
23.04.2014
- 25.04.2014; in: "Evolutionary Computation in Combinatorial Optimization",
C. Blum, G. Ochoa (Hrg.);
Springer Berlin Heidelberg,
8600
(2014),
ISBN: 978-3-662-44319-4;
S. 73
- 84.
Zusätzliche Informationen
C. Kloimüllner, P. Papazek, G. Raidl, B. Hu:
"A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems";
Vortrag: Eurocast 2015,
Gran Canaria, Spain;
08.02.2015
- 13.02.2015; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory",
A. Quesada-Arencibia et al. (Hrg.);
(2015),
ISBN: 978-84-606-5438-4;
S. 125
- 126.
C. Kloimüllner, G. Raidl:
"Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control";
Vortrag: Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Amsterdam;
19.04.2017
- 21.04.2017; in: "Evolutionary Computation in Combinatorial Optimization",
Evolutionary Computation in Combinatorial Optimization,
(2017),
ISBN: 978-3-319-55452-5;
S. 91
- 107.
Zusätzliche Informationen
C. Kloimüllner, G. Raidl:
"Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem";
Vortrag: Conference Proceedings of Learning and Intelligent Optimization Conference,
onference Proceedings of Learning and Intelligent Optimization Conference;
19.06.2017
- 21.06.2017; in: "Conference Proceedings of Learning and Intelligent Optimization Conference",
(2017),
ISBN: 978-3-319-69404-7;
S. 1
- 16.
Zusätzliche Informationen
T. Krenek, M. Ruthmair, G. Raidl, M. Planer:
"Applying (hybrid) metaheuristics to fuel consumption optimization of hybrid electric vehicles";
Vortrag: EvoStar,
Malaga, Spain;
11.04.2012
- 13.04.2012; in: "Applications of Evolutionary Computation - EvoApplications 2012",
volume 7248 of LNCS
(2012),
ISBN: 978-3-642-29177-7;
S. 376
- 385.
Zusätzliche Informationen
M. Leitner, B. Hu, G. Raidl:
"Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem";
Vortrag: International Network Optimization Conference,
Spa, Belgien;
22.04.2007
- 25.04.2007; in: "Proceedings of the International Network Optimization Conference 2007",
(2007).
M. Leitner, G. Raidl:
"A lagrangian decomposition based heuristic for capacitated connected facility location";
Vortrag: Metaheuristic International Conference (MIC),
Hamburg;
13.07.2009; in: "Proceedings of the 8th Metaheuristic International Conference (MIC 2009)",
(2009).
M. Leitner, G. Raidl:
"Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Malaga, Spanien;
08.10.2008
- 09.10.2008; in: "Hybrid Metaheuristics 2008",
(2008),
S. 158
- 174.
M. Leitner, G. Raidl:
"Strong lower bounds for a survivable network design problem";
Vortrag: International Symposium on Combinatorial Optimization (ISCO),
Hammamet, Tunesien;
24.03.2010
- 26.03.2010; in: "ISCO 2010 - International Symposium on Combinatorial Optimization",
36
(2010),
S. 295
- 302.
M. Leitner, G. Raidl:
"Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I",
Volume 6927
(2011),
ISBN: 978-3-642-27548-7;
S. 295
- 302.
Zusätzliche Informationen
M. Leitner, G. Raidl:
"Variable neighborhood search for a prize collecting capacity constrained connected facility location problem";
Vortrag: 2008 International Symposium on Applications and the Internet SAINT 2008,
Turku, Finland;
28.07.2008
- 01.08.2008; in: "Proceedings of the 2008 International Symposium on Applications and the Internet",
IEEE Computer Society,
(2008),
ISBN: 978-0-7695-3297-4;
S. 233
- 236.
M. Leitner, G. Raidl:
"Variable neighborhood search for capacitated connected facility location";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory",
(2011),
ISBN: 978-84-693-9560-8;
S. 261
- 263.
Zusätzliche Informationen
M. Leitner, G. Raidl, U. Pferschy:
"Accelerating column generation for a survivable network design problem";
Vortrag: International Network Optimization Conference (INOC),
Pisa;
26.04.2009
- 29.04.2009; in: "Proceedings of the International Network Optimization Conference 2009",
(2009),
8 S.
Zusätzliche Informationen
M. Leitner, M. Ruthmair, G. Raidl:
"Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem";
Vortrag: International Network Optimization Conference (INOC),
Hamburg, Deutschland;
13.06.2011
- 16.06.2011; in: "Network Optimization: 5th International Conference, INOC 2011",
(2011),
S. 124
- 138.
Zusätzliche Informationen
M. Leitner, M. Ruthmair, G. Raidl:
"Stabilized column generation for the rooted delay-constrained Steiner tree problem";
Vortrag: Workshop on Applied Combinatorial Optimization (ALIO/EURO),
Porto, Portugal;
04.05.2011
- 06.05.2011; in: "Proceedings of the VII ALIO/EURO - Workshop on Applied Combinatorial Optimization",
(2011),
S. 250
- 253.
Zusätzliche Informationen
E. Lizarraga, M. Blesa, C. Blum, G. Raidl:
"On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics";
Vortrag: INISTA 2015,
Madrid, Spain;
02.08.2015
- 05.08.2015; in: "Innovations in Intelligent Systems and Applications (INISTA), 2015 International Symposium on",
D. Camacho et al. (Hrg.);
(2015),
ISBN: 978-1-4673-7751-5;
S. 1
- 8.
Zusätzliche Informationen
D. Markvica, C. Schauer, G. Raidl:
"Solving the Longest Common Subsequence Problem Using a Parallel Ant Colony Optimization Algorithm";
Vortrag: Eurocast 2015,
Gran Canaria, Spain;
08.02.2015
- 13.02.2015; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory",
A. Quesada-Arencibia et al. (Hrg.);
(2015),
ISBN: 978-84-606-5438-4;
S. 113
- 114.
J. Maschler, T. Hackl, M. Riedler, G. Raidl:
"An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem";
Vortrag: Metaheuristics: Proceeding of the MIC and MAEB 2017 Conferences,
Metaheuristics: Proceeding of the MIC and MAEB 2017 Conferences;
04.07.2017
- 07.07.2017; in: "http://mic2017.upf.edu/proceedings/",
(2017),
S. 463
- 472.
Zusätzliche Informationen
J. Maschler, G. Raidl:
"A Logic-based Benders Decomposition Approach for the 3-Staged Strip Packing Problem";
Vortrag: International Conference of the German, Austrian and Swiss Operations Research Societies,
Wien;
01.09.2015
- 04.09.2015; 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;
S. 85
- 102.
Zusätzliche Informationen
J. Maschler, G. Raidl:
"Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem";
Vortrag: Patat2018,
Wien;
28.08.2018
- 31.08.2018; in: "PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling}",
(2018),
S. 375
- 397.
Zusätzliche Informationen
J. Maschler, M. Riedler, G. Raidl:
"Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments";
Vortrag: Computer Aided Systems Theory - EUROCAST 2017,
Spain;
19.02.2017
- 24.02.2017; in: "Computer Aided Systems Theory - EUROCAST 2017",
(2017),
S. 106
- 107.
Zusätzliche Informationen
J. Maschler, M. Riedler, M. Stock, G. Raidl:
"Particle Therapy Patient Scheduling: First Heuristic Approaches";
Vortrag: International Conference of the Practice and Theory of Automated Timetabling (PATAT),
Udine, Italien;
23.08.2016
- 26.08.2016; in: "PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling",
(2016),
ISBN: 978-0-9929984-1-7;
S. 223
- 244.
Zusätzliche Informationen
A. Mayer, C. Nothegger, A Chwatal, G. Raidl:
"Solving the post enrolment course timetabling problem by ant colony optimization";
Vortrag: PATAT 2008,
Montreal, Canada;
18.08.2008
- 22.08.2008; in: "Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling",
(2008),
13 S.
H. Obweger, M. Suntinger, J. Schiefer, G. Raidl:
"Similarity searching in sequences of complex events";
Vortrag: International Conference on Research Challenges in Information Science (RCIS),
Nizza, Frankreich;
19.05.2010
- 21.05.2010; in: "Proceedings of the Fourth International Conference on Research Challenges in Information Science - RCIS 2010",
(2010),
S. 631
- 639.
Zusätzliche Informationen
A. Pagacz, B. Hu, G. Raidl:
"A memetic algorithm with population management for the generalized minimum vertex-biconnected network problem";
Vortrag: International Conference on INTELLIGENT NETWORKING AND COLLABORATIVE SYSTEMS,
Thessaloniki, Greece;
24.11.2010
- 26.11.2010; in: "2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design",
(2010),
S. 356
- 361.
P. Papazek, C. Kloimüllner, B. Hu, G. Raidl:
"Balancing bicycle sharing systems: An analysis of path relinking and recombination within a GRASP hybrid.";
Vortrag: Parallel Problem solving from Nature - PPSN XIII,
Ljubljana;
13.09.2014
- 17.09.2014; in: "Parallel Problem Solving from nature - PPSN XIII",
T. Bartz - Beielstein, J. Branke, B. Filipic, J. Smith (Hrg.);
Lecture Notes in Computer Science, Springer International Publishing,
8672
(2014),
ISBN: 978-3-319-10761-5;
S. 792
- 801.
Zusätzliche Informationen
P. Papazek, G. Raidl, M. Rainer-Harbach, B. Hu:
"A pilot/vnd/grasp hybrid for balancing bicycle sharing systems";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spanien;
10.02.2013
- 15.02.2013; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory",
(2013),
ISBN: 978-84-695-6971-9;
S. 223
- 225.
M. Pimmer, G. Raidl:
"A timeslot-filling based heuristic approach to construct high-school timetables";
Vortrag: Metaheuristic International Conference (MIC),
Udine, Italy;
25.07.2011
- 28.07.2011; in: "Proceedings of the 9th Metaheuristics International Conference",
(2011),
S. 349
- 358.
Zusätzliche Informationen
S. Pirkwieser, G. Raidl:
"A column generation approach for the periodic vehicle routing problem with time windows";
Vortrag: International Network Optimization Conference (INOC),
Pisa;
26.04.2009
- 29.04.2009; in: "Proceedings of the International Network Optimization Conference 2009",
(2009),
6 S.
Zusätzliche Informationen
S. Pirkwieser, G. Raidl:
"A variable neighborhood search for the periodic vehicle routing problem with time windows";
Vortrag: EU/MEeting,
Troyes, Frankreich;
23.10.2008
- 24.10.2008; in: "Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing",
(2008).
S. Pirkwieser, G. Raidl:
"Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques";
Vortrag: Metaheuristic International Conference (MIC),
Hamburg, Deutschland;
13.07.2009
- 16.07.2009; in: "Proceedings of the 8th Metaheuristic International Conference (MIC 2009)",
(2009),
10 S.
S. Pirkwieser, G. Raidl:
"Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms";
Vortrag: GECCO: Genetic and Evolutionary Computation Conference,
Atlanta, USA;
12.07.2008
- 16.07.2008; in: "Proceedings of the 10th annual conference on Genetic and evolutionary computation",
(2008),
S. 323
- 330.
S. Pirkwieser, G. Raidl:
"Matheuristics for the periodic vehicle routing problem with time windows";
Vortrag: International Workshop on Model-Based Metaheuristics,
Wien;
28.06.2010
- 30.06.2010; in: "Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics,",
(2010),
S. 83
- 95.
Zusätzliche Informationen
S. Pirkwieser, G. Raidl:
"Multilevel variable neighborhood search for periodic routing problems";
Vortrag: EvoCOP 2010,
Istanbul, Turkey;
07.04.2010
- 09.04.2010; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010",
(2010),
S. 226
- 238.
Zusätzliche Informationen
S. Pirkwieser, G. Raidl:
"Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Udine, Italien;
16.10.2009
- 17.10.2009; in: "Proceedings of Hybrid Metaheuristics - Sixth International Workshop",
(2009),
S. 45
- 59.
Zusätzliche Informationen
S. Pirkwieser, G. Raidl:
"Variable neighborhood search coupled with ILP-based large neighborhood searches for the (periodic) location-routing problem";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Wien;
01.10.2010
- 02.10.2010; in: "Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010",
(2010),
S. 174
- 189.
Zusätzliche Informationen
S. Pirkwieser, G. Raidl, J. Gottlieb:
"Improved packing and routing of vehicles with compartments";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I",
volume 6927 of LNCS
(2012),
ISBN: 978-3642275487;
S. 392
- 399.
Zusätzliche Informationen
S. Pirkwieser, G. Raidl, J. Gottlieb:
"Tackling the loading aspect of the vehicle routing problem with compartments";
Vortrag: Metaheuristics International Conference (MIC),
Udine, Italy;
25.07.2011
- 28.07.2011; in: "Proceedings of the 9th Metaheuristics International Conference",
(2011),
S. 679
- 681.
S. Pirkwieser, G. Raidl, J. Puchinger:
"Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem";
Vortrag: EvoCOP 2007 - Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation,
Valencia, Spanien;
11.04.2007
- 13.04.2007; in: "Evolutionary Computation in Combinatorial Optimization: 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings",
(2007),
ISBN: 978-3540716143;
S. 176
- 187.
P. Pop, B. Hu, G. Raidl:
"A memetic algorithm for the partition graph coloring problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spanien;
10.02.2013
- 15.02.2013; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory",
(2013),
ISBN: 978-84-695-6971-9;
S. 167
- 169.
M. Prandtstetter, G. Raidl:
"A variable neihborhood search approach for solving the car sequencing problem.";
Vortrag: MECVNS 2005 (XVIII Mini EURO Conference on VNS),
Teneriffa, Spanien;
23.11.2005
- 25.11.2005; in: "Proceedings of the XVIII Mini EURO Conference on VNS",
P. Hansen et al. (Hrg.);
(2005),
ISBN: 84-689-5679-1.
M. Prandtstetter, G. Raidl:
"Combining forces to reconstruct strip shredded text documents";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Malaga, Spanien;
08.10.2008
- 09.10.2008; in: "Hybrid Metaheuristics 2008",
(2008),
S. 175
- 189.
M. Prandtstetter, G. Raidl:
"Meta-heuristics for reconstructing cross cut shredded text documents";
Vortrag: GECCO: Genetic and Evolutionary Computation Conference,
Montreal, Kanada;
08.07.2009
- 12.07.2009; in: "Proceedings of the 11th annual conference on Genetic and evolutionary computation",
(2009),
8 S.
Zusätzliche Informationen
M. Prandtstetter, G. Raidl, T. Misar:
"A hybrid algorithm for computing tours in a spare parts warehouse";
Vortrag: Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Tübingen, Deutschland;
15.04.2009
- 17.04.2009; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2009",
Springer,
(2009),
S. 25
- 36.
Zusätzliche Informationen
M. Prischink, C. Kloimüllner, B. Biesinger, G. Raidl:
"Districting and Routing for Security Control";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Plymouth, United Kingdom;
08.06.2016
- 10.06.2016; in: "Hybrid Metaheuristics - 10th International Workshop on Hybrid Metaheuristics",
LNCS,
9668
(2016),
ISBN: 978-3-319-39636-1;
S. 87
- 103.
Zusätzliche Informationen
J. Puchinger, G. Raidl:
"Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification.";
Vortrag: IWINAC 2005 (First International Work-Conference on the Interplay Between Natural and Artificial Computation),
Canary Islands, Spanien;
15.06.2005
- 18.06.2005; in: "Artifical Intelligence and Knowledge Engineering Applications: A Bioinspired Approach",
J. Mira (Hrg.);
Springer,
Lecture Notes in Computer Science 3562
(2005),
ISBN: 3-540-26319-5;
S. 41
- 53.
Zusätzliche Informationen
J. Puchinger, G. Raidl:
"Relaxation guided variable neighborhood search.";
Vortrag: MECVNS 2005 (XVIII Mini EURO Conference on VNS),
Teneriffa, Spanien;
23.11.2005
- 25.11.2005; in: "Proceedings of the XVIII Mini EURO Conference on VNS",
P. Hansen et al. (Hrg.);
(2005),
ISBN: 84-689-5679-1.
J. Puchinger, G. Raidl, M. Gruber:
"Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem.";
Vortrag: MIC2005 (The 6th Metaheuristics International Conference),
Wien;
22.08.2005
- 26.08.2005; in: "Proceedings of MIC2005, the 6th Metaheuristics International Conference",
(2005).
Zusätzliche Informationen
J. Puchinger, G. Raidl, U. Pferschy:
"The core concept for the multidimensional knapsack problem.";
Vortrag: Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Budapest, Ungarn;
10.04.2006
- 12.04.2006; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2006, volume 3906 of LNCS",
J. Gottlieb, G. Raidl (Hrg.);
Springer,
Heidelberg
(2006),
ISBN: 978-3-540-33178-0;
S. 195
- 208.
G. Raidl:
"A unified view on hybrid metaheuristics.";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Gran Canaria, Spanien;
13.10.2006
- 15.10.2006; in: "Hybrid Metaheuristics - Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-14, 2006, Proceedings",
F. Almeida et al. (Hrg.);
Springer,
Heidelberg
(2006),
ISBN: 978-3-540-46384-9;
S. 1
- 12.
Zusätzliche Informationen
G. Raidl, T. Baumhauer, B. Hu:
"Boosting an exact logic-based benders decomposition approach by variable neighborhood search.";
Vortrag: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search,
Djerba, Tunesien;
08.10.2014
- 11.10.2014; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search",
B. Jarboui, A. Sifaleras, A. Rebai (Hrg.);
Elsevier Electronic Notes in Discrete Mathematics,
47
(2015),
S. 149
- 156.
Zusätzliche Informationen
G. Raidl, T. Baumhauer, B. Hu:
"Speeding up logic-based benders' decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem.";
Vortrag: International Workshop on Hybrid Metaheuristics 2014 - HM 2014,
Hamburg;
11.06.2014
- 13.06.2014; in: "Hybrid Metaheuristics, 9th Int. Workshop, HM 2014",
M. Blesa, C. Blum, S. Voß (Hrg.);
(2014),
ISBN: 978-3-319-07643-0;
S. 183
- 197.
Zusätzliche Informationen
G. Raidl, A Chwatal:
"Fingerprint template compression by solving a minimum label $k$-node subtree problem";
Vortrag: International Conference of Numerical Analysis and Applied Mathematics (ICNAAM),
Korfu, Griechenland;
16.09.2007
- 20.09.2007; in: "International Conference of Numerical Analysis and Applied Mathematics",
(2007),
ISBN: 978-0-7354-0447-2;
S. 444
- 447.
G. Raidl, M. Gruber:
"A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem";
Vortrag: International Conference of Numerical Analysis and Applied Mathematics (ICNAAM),
Korfu, Griechenland;
16.09.2008
- 20.09.2008; in: "Proceedings of the International Conference on Numerical Analysis and Applied Mathematics",
(2008),
S. 446
- 449.
G. Raidl, B. Hu:
"Enhancing genetic algorithms by a trie-based complete solution archive";
Vortrag: EvoCOP 2010,
Istanbul, Turkey;
07.04.2010
- 09.04.2010; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010",
(2010),
S. 239
- 251.
Zusätzliche Informationen
G. Raidl, B. Hu, M. Rainer-Harbach, P. Papazek:
"Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Ischia, Italien;
23.05.2013
- 25.05.2013; in: "Hybrid Metaheuristics, 8th Int. Workshop, HM 2013",
Volume 7919
(2013),
ISBN: 978-3-642-38515-5;
S. 130
- 143.
Zusätzliche Informationen
G. Raidl, T. Jatschka, M. Riedler, J. Maschler:
"Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics";
Vortrag: International Workshop on Model-Based Metaheuristics,
Brüssel, Belgien;
04.09.2016
- 07.09.2016; in: "Proceedings of the Sixth International Workshop on Model-based Metaheuristics",
(2016),
S. 104
- 107.
Zusätzliche Informationen
M. Rainer-Harbach, P. Papazek, B. Hu, G. Raidl:
"Balancing bicycle sharing systems: A variable neighborhood search approach";
Vortrag: Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Wien;
03.04.2013
- 05.04.2013; in: "Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013",
Volume 7832
(2013),
ISBN: 978-3-642-37197-4;
S. 121
- 132.
Zusätzliche Informationen
A. Rendl, M. Prandtstetter, G. Hiermann, J. Puchinger, G. Raidl:
"A hybrid heuristic for multimodal homecare scheduling";
Vortrag: International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming,
Nantes, Frankreich;
28.05.2012
- 01.06.2012; 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;
S. 339
- 355.
Zusätzliche Informationen
M. Riedler, M. Ruthmair, G. Raidl:
"Strategies for Iteratively Refining Layered Graph Models";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Concepcion, Chile;
16.01.2019
- 18.01.2019; in: "Hybrid Metaheuristics: 11th International Workshop",
Lecture Notes in Computer Science,
11299
(2019),
ISBN: 978-3-030-05982-8;
S. 46
- 62.
Zusätzliche Informationen
U. Ritzinger, M. Prandtstetter, G. Raidl:
"Computing optimized stock (re-)placements in last-in, first-out warehouses";
Vortrag: Logistik Management,
Hamburg, Deutschland;
02.09.2009
- 04.09.2009; in: "Logistik Management",
(2009),
ISBN: 978-3-7908-2361-5;
S. 279
- 298.
Zusätzliche Informationen
M. Ruthmair, A. Hubmer, G. Raidl:
"Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory",
(2011),
ISBN: 978-84-693-9560-8;
S. 285
- 287.
Zusätzliche Informationen
M. Ruthmair, G. Raidl:
"A Kruskal-based heuristic for the rooted delay-constrained minimum spanning tree problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria;
15.02.2009
- 20.02.2009; in: "Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)",
(2009),
S. 244
- 246.
M. Ruthmair, G. Raidl:
"A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spanien;
15.02.2009
- 20.02.2009; in: "Computer Aided Systems Theory - EUROCAST 2009, volume 5717 of LNCS",
(2009),
ISBN: 978-3-642-04771-8;
S. 713
- 720.
Zusätzliche Informationen
M. Ruthmair, G. Raidl:
"A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems";
Vortrag: Conference on Integer Programming and Combinatorial Optimization (IPCO),
New York, USA;
15.06.2011
- 17.06.2011; in: "Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV)",
(2011),
S. 376
- 388.
Zusätzliche Informationen
M. Ruthmair, G. Raidl:
"A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem";
Vortrag: International Conference on Computer Aided Systems Theory (Eurocast),
Gran Canaria, Spain;
06.02.2011
- 11.02.2011; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I",
(2011),
ISBN: 978-84-693-9560-8;
S. 351
- 358.
Zusätzliche Informationen
M. Ruthmair, G. Raidl:
"On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem";
Vortrag: International Symposium on Combinatorial Optimization (ISCO),
Athen, Griechenland;
17.04.2012
- 21.04.2012; in: "Proceedings of the 2nd International Symposium on Combinatorial Optimization",
volume 7422 of LNCS
(2012),
ISBN: 978-3-642-32146-7;
S. 225
- 236.
Zusätzliche Informationen
M. Ruthmair, G. Raidl:
"Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem";
Vortrag: International Conference on Parallel Problem Solving From Nature (PPSN),
Krakow, Poland;
11.09.2010
- 15.09.2010; in: "Parallel Problem Solving from Nature - PPSN XI",
(2010),
S. 391
- 400.
Zusätzliche Informationen
C. Schauer, M. Prandtstetter, G. Raidl:
"A memetic algorithm for reconstructing cross-cut shredded text documents";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Wien;
01.10.2010
- 02.10.2010; in: "Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010",
(2010),
S. 103
- 117.
Zusätzliche Informationen
C. Schauer, G. Raidl:
"A Multi-Commodity FLow Based Model for Multi Layer Hierarchical Ring Network Design";
Vortrag: International Network Optimization Conference (INOC),
Warschau, Polen;
18.05.2015
- 20.05.2015; in: "Proceedings of INOC 2015 - 7th International Network Optimization Conference",
(2016),
ISSN: 1571-0653;
S. 189
- 196.
Zusätzliche Informationen
C. Schauer, G. Raidl:
"Analyzing Decoding Strategies in a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem";
Vortrag: Eurocast 2015,
Gran Canaria, Spain;
08.02.2015
- 13.02.2015; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory",
A. Quesada-Arencibia (Hrg.);
(2015),
ISBN: 978-84-606-5438-4;
S. 81
- 82.
C. Schauer, G. Raidl:
"Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design";
Poster: International Conference on Parallel Problem Solving From Nature (PPSN),
Taormina, Italien;
01.09.2012
- 05.09.2012; in: "Parallel Problem Solving from Nature-PPSN XII",
volume 7491 of LNCS
(2012),
ISBN: 978-3-642-32936-4;
S. 458
- 467.
Zusätzliche Informationen
A. Schöbel, G. Raidl, I. Grujicic, G. Besau, G. Schuster:
"An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure";
Vortrag: 5th International Seminar on Railway Operations Modelling and Analysis,
Copenhagen;
13.05.2013
- 15.05.2013; in: "Proceedings",
(2013),
ISBN: 978-87-7327-246-6;
Paper-Nr. 21,
10 S.
Zusätzliche Informationen
M. Schwengerer, S. Pirkwieser, G. Raidl:
"A variable neighborhood search approach for the two-echelon location-routing problem";
Vortrag: Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Malaga, Spain;
11.04.2012
- 13.04.2012; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2012",
volume 7245 of LNCS
(2012),
ISBN: 978-3-642-29123-4;
S. 13
- 24.
Zusätzliche Informationen
M. Suntinger, H. Obweger, J. Schiefer, P. Limbeck, G. Raidl:
"Trend-based similarity search in time-series data";
Vortrag: International Conference on Advances in Databases, Knowledge, and Data Applications (DBKDA),
Menuires, FRANCE;
11.04.2010
- 16.04.2010; in: "Proceedings of the Second International Conference on Advances in Database, Knowledge, and Data Applications - DBKDA 2010",
(2010),
S. 97
- 106.
Zusätzliche Informationen
A. Tus, A. Rendl, G. Raidl:
"Metaheuristics for the Two-Dimensional Container-Pre-Marshalling-Problem";
Vortrag: LION 9,
Lille, France;
12.01.2015
- 15.01.2015; in: "Learning and Intelligent Optimization",
C. Dhaenens, L. Jourdan, M. Marmion (Hrg.);
8994
(2015),
ISBN: 978-3-319-19084-6;
S. 186
- 201.
Zusätzliche Informationen
D. Wagner, U. Pferschy, P. Mutzel, G. Raidl, P. Bachhiesl:
"A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks";
Vortrag: International Network Optimization Conference,
Spa, Belgien;
22.04.2007
- 25.04.2007; in: "Proceedings of the International Network Optimization Conference 2007",
(2007).
D. Wagner, G. Raidl, U. Pferschy, P. Mutzel, P. Bachhiesl:
"A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks.";
Vortrag: Operations Research,
Karlsruhe, Deutschland;
06.09.2006
- 08.09.2006; in: "Operations Research Proceedings 2006, Karlsruhe",
Springer,
Heidelberg
(2007),
ISBN: 978-3-540-69994-1.
J. Walla, M. Ruthmair, G. Raidl:
"Solving a video-server load re-balancing problem by mixed integer programming and hybrid variable neighborhood search";
Vortrag: International Workshop on Hybrid Metaheuristics (HM),
Udine, Italien;
16.10.2009
- 17.10.2009; in: "Hybrid Metaheuristics 2009, volume 5818 of LNCS",
(2009),
ISBN: 978-3-642-04917-0;
S. 84
- 99.
Zusätzliche Informationen
Vorträge und Posterpräsentationen (ohne Tagungsband-Eintrag)
C. Bacher, G. Raidl:
"Cyclic Giant Tour Decoding for the EVRPTW";
Vortrag: European Conference on Operational Research,
Poznan, Polen;
03.07.2016
- 06.07.2016.
Zusätzliche Informationen
C. Bacher, G. Raidl:
"Integrating Algebraic Dynamic Programming in Combinatorial Optimization";
Vortrag: Austrian Workshop on Metaheuristics,
Graz;
02.12.2016.
Zusätzliche Informationen
C. Bacher, G. Raidl:
"Mixed Integer Programming Models for Hybrid Electric Vehicle Routing";
Vortrag: VeroLog 2015,
Universität Wien (eingeladen);
08.06.2015
- 10.06.2015.
A Chwatal, G. Raidl:
"Applying branch-and-cut for compressing fingerprint templates";
Vortrag: EURO XXII: 22nd European Conference on Operational Research,
Prag, Tschechische Republik;
08.07.2007
- 11.07.2007.
Zusätzliche Informationen
A Chwatal, G. Wuchterl, G. Raidl:
"Fitting multi-planet transit models to corot time-data series by evolutionary algorithms";
Poster: COROT,
Paris;
02.02.2009
- 05.02.2009.
M. Horn, M. Djukanovic, C. Blum, G. Raidl:
"On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences";
Vortrag: CPAIOR 2020,
Wien;
21.09.2020
- 24.09.2020.
Zusätzliche Informationen
B. Hu, M. Leitner, G. Raidl:
"Large Neighborhoods in Variable Neighborhood Search Approaches for Generalized Network Design Problems";
Vortrag: 1st Workshop on Mathematical Contributions to Metaheuristics (Matheuristics 2006),
Bertinoro, Italien;
27.08.2006
- 30.08.2006.
T. Jatschka, T. Rodemann, G. Raidl:
"A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications";
Vortrag: Honda Research Institute Europe, Offenbach, Germany,
Honda Research Institute Europe, Offenbach, Germany (eingeladen);
08.09.2021
- 09.09.2021.
Zusätzliche Informationen
B. Klocker, G. Raidl:
"Heuristic Approaches for Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers";
Vortrag: Austrian Workshop on Metaheuristics,
Graz;
02.12.2016.
Zusätzliche Informationen
C. Kloimüllner, P. Papazek, B. Hu, G. Raidl:
"Balancing Bicycle Sharing Systems";
Vortrag: EULOG 2014,
Wien;
17.11.2014
- 18.11.2014.
J. Maschler, M. Riedler, M. Stock, G. Raidl:
"Particle Therapy Patient Scheduling: First Heuristic Approaches";
Vortrag: European Conference on Operational Research,
Poznan, Polen;
03.07.2016
- 06.07.2016.
Zusätzliche Informationen
S. Pirkwieser, R. Ruiz-Torrubiano, G. Raidl:
"Exact methods and metaheuristic approaches for deriving high quality fully resolved consensus trees";
Poster: BIRD'08 2nd International Conference on Bioinformatics Research and Development,
Wien (eingeladen);
07.07.2008
- 09.07.2008.
M. Prandtstetter, G. Raidl:
"Two Integer Linear Programming Approaches for Solving the Car Sequencing Problem";
Vortrag: 10th International Workshop on Combinatorial Optimization,
Aussois, Frankreich;
09.01.2006
- 13.01.2006.
M. Prandtstetter, G. Raidl, P. Schüller:
"Reconstructing Sheets of Manually Torn Paper";
Vortrag: 11th International Workshop on Combinatorial Optimization,
Aussois, Frankreich;
08.01.2007
- 12.01.2007.
J. Puchinger, G. Raidl, G. Koller:
"Solving a real-world glass cutting problem";
Vortrag: EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization,
Coimbra, Portugal;
05.04.2004
- 07.04.2004.
G. Raidl:
"Algorithms for Vehicle Routing";
Vortrag: Workshop on Advances and Improvements in Service Delivery to Regional Development: Cases of Transportation and Health,
La Laguna, Spain (eingeladen);
14.07.2016
- 16.07.2016.
G. Raidl:
"An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing";
Vortrag: PPSN: International Conference on Parallel Problem Solving From Nature VIII,
Birmingham, Großbritannien;
18.09.2004
- 22.09.2004.
G. Raidl:
"An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem";
Vortrag: PPSN: International Conference on Parallel Problem Solving From Nature VIII,
Birmingham, Großbritannien;
18.09.2004
- 22.09.2004.
G. Raidl:
"An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem";
Vortrag: ACM Symposium on Applied Computing,
Nicosia;
14.03.2004
- 17.03.2004.
G. Raidl:
"An Iterative Time-Bucket Refinement Algorithm for a Resource-Constrained Project Scheduling Problem";
Vortrag: TU Graz, Institute for Discrete Mathematics,
TU Graz, Institute for Discrete Mathematics (eingeladen);
21.03.2017.
Zusätzliche Informationen
G. Raidl:
"Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems";
Vortrag: First Int. Workshop on Information Network Design,
Kitakyushu City, Fukuoka, Japan (eingeladen);
05.12.2008.
G. Raidl:
"Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems";
Vortrag: University of Nottingham, School of Computer Science,
Nottingham, United Kingdom (eingeladen);
22.04.2009.
G. Raidl:
"Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems";
Hauptvortrag: Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science,
Znaim, Tschechien (eingeladen);
13.11.2009
- 15.11.2009.
Zusätzliche Informationen
G. Raidl:
"Cooperative Hybrids for Combinatorial Optimization";
Vortrag: Int. Workshop on Nature Inspired Cooperative Strategies for Optimization,
Puerto de La Cruz, Tenerife, Spain (eingeladen);
13.11.2008.
G. Raidl:
"Evolutionary Computation for Combinatorial Optimization";
Vortrag: EvoNet Summer School 2003,
University of Parma, Italy;
24.08.2003
- 31.08.2003.
G. Raidl:
"Hybrid Estimation of Distribution on Algorithm for Multiobjective Knapsack Problems";
Vortrag: EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization,
Coimbra, Portugal;
05.04.2004
- 07.04.2004.
G. Raidl:
"Hybrid Metaheuristics and Matheuristics";
Vortrag: International Conference on Metaheuristics and Nature Inspired Computing,
Port El-Kantaoiui, Tunisia (eingeladen);
27.10.2012
- 31.10.2012.
G. Raidl:
"Innovative Lösungen für Routenplanung, Packungsprobleme und Lagerlogistik";
Vortrag: Aktuelles Know-How der TU Wien für Logistik und Distribution, Ausseninstitut-Technologietransfer,
Wien (eingeladen);
21.10.2009.
Zusätzliche Informationen
G. Raidl:
"Kombinationen von Metaheuristiken und Methoden der mathematischen Programmierung zur Lösung schwieriger Netzwerkdesign-Probleme";
Vortrag: Upper Austrian University of Applied Sciences, Department of Software Engineering,
Hagenberg (eingeladen);
06.05.2009.
G. Raidl:
"Metaheuristics and Hybrid Optimization Approaches - A Unifying View";
Vortrag: European Conference on Operational Research,
Rom (eingeladen);
03.07.2013.
G. Raidl:
"Metaheuristics for Solving a Scheduling Problem in Car Manufacturing";
Vortrag: ICAM5 - Fifth International Conference on Applied Mathematics,
Baia Mare, Rumänien;
21.09.2006
- 25.09.2006.
G. Raidl:
"Metaheuristics for the Static Balancing of Bicycle Sharing Systems";
Vortrag: European Conference on Operational Research,
Rom;
03.07.2013.
G. Raidl:
"Mixed Integer Programming Approaches for Resource-Constrained Project Scheduling";
Vortrag: University of Vienna, Department of Statistics and Operations Research,
University of Vienna, Department of Statistics and Operations Research (eingeladen);
06.07.2017.
G. Raidl:
"Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem";
Vortrag: Research Institute of Molecular Pathology, Biocenter Vienna,
Wien;
31.08.2003.
G. Raidl:
"New ILP Approaches for 3-Staged Two-Dimensional Bin Packing";
Vortrag: EUROXX: 20th European Conference on Operational Research,
Rhodos;
04.07.2004
- 07.07.2004.
G. Raidl:
"On the Hybridization of Evolutionary Algorithms";
Vortrag: Genetic and Evolutionary Computation Conference (GECCO 2003),
Chicago, IL;
12.07.2003
- 16.07.2003.
G. Raidl:
"Optimization Approaches for Balancing Bicycle Sharing Systems";
Vortrag: Department of Business Administration, Production and Operations Management Group, University of Vienna,
Wien (eingeladen);
08.03.2013.
G. Raidl:
"Some Thoghts on How to Make Memetic Algorithms for Multiobjective Knapsack Problems";
Vortrag: PPSN: International Conference on Parallel Problem Solving From Nature VIII,
Birmingham;
18.09.2004
- 22.09.2004.
G. Raidl:
"Variable Neighborhood Search Hybrids";
Hauptvortrag: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search,
Djerba, Tunesien (eingeladen);
08.10.2014
- 11.10.2014.
G. Raidl, E. Causevic, B. Hu, M. Rainer-Harbach:
"Balancing Bicycle Sharing Systems by Variable Neighborhood Search";
Vortrag: EUROmC XXVIII VNS,
Herceg Novi, Montenegro (eingeladen);
04.10.2012
- 07.10.2012.
G. Raidl, B. Hu, M. Leitner:
"Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem";
Vortrag: 19th International Symposium on Mathematical Programming,
Rio de Janeiro, Brasilien;
30.07.2006
- 04.08.2006.
Zusätzliche Informationen
M. Ruthmair, G. Raidl:
"An Adaptive Layers Framework for Resource-Constrained Network Design Problems";
Vortrag: INFORMS Telecommunications Conference,
Boca Raton, Florida, USA;
15.03.2012
- 17.03.2012.
Zusätzliche Informationen
M. Ruthmair, G. Raidl:
"An Adaptive Layers Framework for Vehicle Routing Problems";
Vortrag: International Symposium on Mathematical Programming,
Berlin, Deutschland;
19.08.2012
- 24.08.2012.
Zusätzliche Informationen
Habilitationsschriften
G. Raidl:
"Hybrid Evolutionary Algorithms for Combinatorial Optimization";
Technische Universität Wien,
2003.
Dissertationen (eigene und begutachtete)
B. Biesinger:
"Complete Solution Archives for Evolutionary Combinatorial Optimization";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, C. Blum, U. Pferschy;
Institut für Computergraphik und Algorithmen,
2016;
Rigorosum: 03.06.2016.
Zusätzliche Informationen
A Chwatal:
"On the Minimum Label Spanning Tree Problem: Solution Methods and Applications";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, U. Pferschy;
Institut für Computergraphik und Algorithmen,
2010;
Rigorosum: 16.06.2010.
Zusätzliche Informationen
M. Djukanovic:
"Exact and Heuristic Approaches for Solving String Problems from Bioinformatics";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, C. Blum;
Institute of Logic and Computation,
2021;
Rigorosum: 05.05.2021.
Zusätzliche Informationen
R. El-Berry:
"Selbstausrichtende Prozesse - Elemente der Künstlichen Intelligenz im Geschäftsmanagement";
Betreuer/in(nen), Begutachter/in(nen): J. Dorn, G. Raidl;
Institut für Informationssysteme, Arbeitsbereich Datenbanker & Artificial Intelligence,
2006.
M. Gruber:
"Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, U. Pferschy;
Institut für Computergraphik und Algorithmen,
2009;
Rigorosum: 16.06.2009.
Zusätzliche Informationen
M. Horn:
"Advances in Search Techniques for Combinatorial Optimization: New Anytime A* Search and Decision Diagram Based Approaches";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, C. Blum, L. Di Gaspero;
Institute of Logic and Computation,
2021;
Rigorosum: 09.09.2021.
Zusätzliche Informationen
B. Hu:
"Hybrid Metaheuristics for Generalized Network Design Problems";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, U. Pferschy;
Institut für Computergraphik und Algorithmen,
2008;
Rigorosum: 11.12.2008.
Zusätzliche Informationen
J. Inführ:
"Optimization Challenges of the Future Federated Internet";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, K. Tutschku;
Institut für Computergraphik and Algorithmen,
2013;
Rigorosum: 27.11.2013.
Zusätzliche Informationen
B. Klocker:
"Combinatorial Optimization Approaches for Graph Construction Problems";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, H. Fleischner;
Institute of Logic and Computation,
2020;
Rigorosum: 25.03.2020.
Zusätzliche Informationen
C. Kloimüllner:
"Algorithmic approaches for Optimization problems in bike sharing and security control";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, K. Sörensen, N. Musliu;
Institute of Logic and Computation,
2019;
Rigorosum: 31.01.2019.
Zusätzliche Informationen
T. Krenek:
"Optimierung von elektro-hybriden Antriebskonzepten mittels heuristischer Optimierungsverfahren";
Betreuer/in(nen), Begutachter/in(nen): T. Lauer, G. Raidl;
Institut für Fahrzeugantriebe und Automobiltechnik,
2015;
Rigorosum: 07.09.2015.
Zusätzliche Informationen
M. Leitner:
"Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, U. Pferschy;
Institut für Computergraphik und Algorithmen,
2010;
Rigorosum: 16.06.2010.
Zusätzliche Informationen
J. Maschler:
"Patient scheduling in particle therapy";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, L. Di Gaspero, N. Musliu;
Institute of Logic and Computation,
2019;
Rigorosum: 20.03.2019.
Zusätzliche Informationen
N. Mujezinovic:
"Improved Protein Identification After Fast Elimination of Non-Interpretable Peptide MS/MS Spectra and Noise Reduction";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, F. Eisenhaber;
Institut für Computergraphik und Algorithmen, TU Wien,
2007;
Rigorosum: 05/2007.
Zusätzliche Informationen
S. Pirkwieser:
"Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, K. Dörner;
Institut für Computergraphik und Algorithmen,
2012;
Rigorosum: 14.06.2012.
Zusätzliche Informationen
M. Prandtstetter:
"Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documents";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, U. Pferschy;
Institut für Computergraphik und Algorithmen,
2009.
Zusätzliche Informationen
J. Puchinger:
"Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems.";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, U. Pferschy;
Institut für Computergraphik und Algorithmen,
2006;
Rigorosum: 01/2006.
M. Ruthmair:
"On Solving Constrained Tree Problems and an Adaptive Layers Framework";
Betreuer/in(nen), Begutachter/in(nen): G. Raidl, U. Pferschy;
Institut für Computergraphik und Algorithmen,
2012;
Rigorosum: 21.06.2012.
Zusätzliche Informationen
Diplom- und Master-Arbeiten (eigene und betreute)
C. Bacher:
"Metaheuristic optimization of electro-hybrid powertrains using machine learning techniques";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik and Algorithmen,
2013;
Abschlussprüfung: 08/2013.
Zusätzliche Informationen
C. Berger:
"Solving a Generalized Constrained Longest Common Subsequence Problem";
Betreuer/in(nen): G. Raidl, M. Djukanovic;
Institute of Logic and Computation,
2020;
Abschlussprüfung: 06/2020.
Zusätzliche Informationen
F. Berger:
"Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen";
Betreuer/in(nen): G. Raidl, M. Prandtstetter;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 09/2008.
Zusätzliche Informationen
M. Berlakovich:
"Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem";
Betreuer/in(nen): G. Raidl, M. Ruthmair;
Institut für Computergraphik und Algorithmen,
2010;
Abschlussprüfung: 07/2010.
Zusätzliche Informationen
B. Biesinger:
"Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents";
Betreuer/in(nen): G. Raidl, C. Schauer, B. Hu;
Institut für Computergraphik und Algorithmen,
2012;
Abschlussprüfung: 05/2012.
Zusätzliche Informationen
B. Bonigl:
"A Branch-and-Bound Approach for the Constrained K-Staged 2-Dimensional Cutting Stock Problem";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2016;
Abschlussprüfung: 11.02.2016.
Zusätzliche Informationen
C. Bonitz:
"An incremental dynamic programming approach for multidimensional allocation problems";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 05/2008.
Zusätzliche Informationen
A Braumann:
"Map-Matching und Wegsuche in einem geografischen Informationssystem";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2007;
Abschlussprüfung: 01/2007.
Th. Bucsics:
"Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks";
Betreuer/in(nen): G. Raidl, D. Wagner;
Institut für Computergraphik und Algorithmen, TU Wien,
2007;
Abschlussprüfung: 03/2007.
Zusätzliche Informationen
A Chwatal:
"Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen.";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2006;
Abschlussprüfung: 01/2006.
O. Dietzel:
"Combinatorial Optimization for the Compression of Biometric Templates";
Betreuer/in(nen): G. Raidl, A Chwatal;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 05/2008.
Zusätzliche Informationen
F. Dusberger:
"Improving the protein identification performance in high-resolution mass spectrometry data";
Betreuer/in(nen): G. Raidl, K. Mechtler, P. Pichler;
Institut für Computergraphik und Algorithmen,
2012;
Abschlussprüfung: 10/2012.
Zusätzliche Informationen
K. Edlinger:
"Optimierung der periodischen Tourenplanung in der Müllentsorgung";
Betreuer/in(nen): G. Raidl, M. Ruthmair;
Institut für Computergraphik und Algorithmen,
2011;
Abschlussprüfung: 07/2011.
Zusätzliche Informationen
J. Fauster:
"Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem";
Betreuer/in(nen): G. Raidl, G. Koller;
Institut für Computergraphik und Algorithmen,
2003.
H. Feltl:
"Ein genetischer Algorithmus für das Generalized Assignment Problem";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2003.
D. Fischinger:
"Dynamische Reihenfolgeoptimierung mittels Simulation und Meta-Heuristiken.";
Betreuer/in(nen): G. Raidl, W. Stöcher;
Institut für Computergraphik und Algorithmen,
2005.
G. Fritz:
"A hybrid algorithm for the partition coloring problem.";
Betreuer/in(nen): G. Raidl, B. Hu;
Computergraphik und Algorithmen,
2014.
Zusätzliche Informationen
G. Fritz:
"Heuristic methods for the hop constrained survivable network design problem";
Betreuer/in(nen): G. Raidl, M. Leitner;
Institut für Computergraphik und Algorithmen,
2011;
Abschlussprüfung: 09/2011.
Zusätzliche Informationen
V. Gamper:
"Multiple structural RNA alignment with affine gap costs based on Lagrangian relaxation.";
Betreuer/in(nen): G. Raidl, G.W. Klau;
Insitut für Computergraphik und Algorithmen,
2005.
P. Gebhard:
"The vehicle routing problem with compartments";
Betreuer/in(nen): G. Raidl, S. Pirkwieser;
Institut für Computergraphik und Algorithmen,
2012;
Abschlussprüfung: 10/2012.
Zusätzliche Informationen
C. Gruber:
"Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem";
Betreuer/in(nen): G. Raidl, B. Hu;
Institut für Computergraphik und Algorithmen,
2011;
Abschlussprüfung: 09/2011.
Zusätzliche Informationen
G. Gruber:
"Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problem.";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2004.
A. Heigl:
"Option pricing by means of genetic programming.";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2005.
G. Hiermann:
"Metaheuristics for a multimodal home-health care scheduling problem";
Betreuer/in(nen): G. Raidl, J. Puchinger;
Institut für Computergraphik und Algorithmen,
2012;
Abschlussprüfung: 05/2012.
Zusätzliche Informationen
J. Inführ:
"Automatic generation of 2-antwars players with genetic programming";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2010;
Abschlussprüfung: 07/2010.
Zusätzliche Informationen
I. Ivezic:
"Extending the gecode framework with interval constraint programming";
Betreuer/in(nen): G. Raidl, L. Di Gaspero;
Institut für Computergraphik und Algorithmen,
2012;
Abschlussprüfung: 10/2012.
Zusätzliche Informationen
P. Jahrmann:
"Metaheuristics for the regenerator location problem";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik and Algorithmen,
2013;
Abschlussprüfung: 03/2013.
Zusätzliche Informationen
R. Karl:
"The rooted delay-constrained steiner tree problem with uncertain delays";
Betreuer/in(nen): G. Raidl, M. Leitner, M. Ruthmair;
Institut für Computergraphik and Algorithmen,
2013;
Abschlussprüfung: 12/2013.
Zusätzliche Informationen
S. Kersting:
"Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2003.
P. Klaffenböck:
"Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework.";
Betreuer/in(nen): G. Raidl;
Institut für Computergrafik und Algorithmen,
2014.
Zusätzliche Informationen
B. Klocker:
"Optimierungsansätze zur Planung von Freizeit-Fahrradrouten";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2015;
Abschlussprüfung: 04/2015.
Zusätzliche Informationen
M. Knausz:
"Parallel variable neighborhood search for the car sequencing problem";
Betreuer/in(nen): G. Raidl, M. Prandtstetter;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 10/2008.
Zusätzliche Informationen
B. Kopinitsch:
"An ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem.";
Betreuer/in(nen): G. Raidl, M. Gruber;
Institut für Computergraphik und Algorithmen,
2006;
Abschlussprüfung: 01/2006.
T. Krenek:
"Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus";
Betreuer/in(nen): G. Raidl, M. Ruthmair;
Institut für Computergraphik und Algorithmen,
2011;
Abschlussprüfung: 07/2011.
Zusätzliche Informationen
S. Kuran:
"Heuristische Optimierungsverfahren für die Koordinierung von Flughafenslots";
Betreuer/in(nen): G. Raidl, A Chwatal;
Institute of Logic and Computation,
2020;
Abschlussprüfung: 03/2020.
Zusätzliche Informationen
F. Leberl:
"Column Generation at Strip Level for the K-Staged Two-Dimensional Cutting Stock Problem";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2016;
Abschlussprüfung: 22.03.2016.
Zusätzliche Informationen
M. Leitner:
"Solving two generalized network design problems with exact and heuristic methods.";
Betreuer/in(nen): G. Raidl, B. Hu;
Institut für Computergraphik und Algorithmen,
2006;
Abschlussprüfung: 05/2006.
S. Leopold:
"An alignment graph based evolutionary algorithm for the multiple sequence alignment problem";
Betreuer/in(nen): G. Raidl, G. Koller;
Institut für Computergraphik und Algorithmen,
2004.
D. Lichtenberger:
"An extended local branching framework and its application to the multidimensional knapsack problem.";
Betreuer/in(nen): G. Raidl, J. Puchinger;
Institut für Computergraphik und Algorithmen,
2005.
D. Markvica:
"Finding longest common subsequences by GPU-based parallel ant colony optimization.";
Betreuer/in(nen): G. Raidl;
Computergraphik und Algorithmen,
2014.
Zusätzliche Informationen
T. Misar:
"Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenndung in einem Ersatzteillager mit domänenspezifischen Nebenbedingungen";
Betreuer/in(nen): G. Raidl, M. Prandtstetter;
Institut für Computergraphik und Algorithmen,
2009;
Abschlussprüfung: 04/2009.
Zusätzliche Informationen
W. Morandell:
"Evaluation and reconstruction of strip-shredded text documents";
Betreuer/in(nen): G. Raidl, M. Prandtstetter;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 05/2008.
Zusätzliche Informationen
N. Musil:
"Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung";
Betreuer/in(nen): G. Raidl, A Chwatal;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 12/2008.
Zusätzliche Informationen
P. Neuner:
"Algorithmic Approaches to the String Barcoding Problem";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2007;
Abschlussprüfung: 10/2007.
Zusätzliche Informationen
K. Oberlechner:
"Solving the k-node minimum label spanning arborescence problem with exact and heuristic methods";
Betreuer/in(nen): G. Raidl, A Chwatal;
Institut für Computergraphik und Algorithmen,
2010;
Abschlussprüfung: 08/2010.
Zusätzliche Informationen
H. Obweger:
"Similarity searching in complex business events and sequences thereof";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2009;
Abschlussprüfung: 03/2009.
Zusätzliche Informationen
A. Pagacz:
"Heuristic methods for solving two generalized network problems";
Betreuer/in(nen): G. Raidl, B. Hu;
Institut für Computergraphik und Algorithmen,
2010;
Abschlussprüfung: 02/2010.
Zusätzliche Informationen
T. Petelin:
"Two-phase local search for the bi-objective connected facility location problem";
Betreuer/in(nen): G. Raidl, M. Leitner;
Institut für Computergraphik and Algorithmen,
2013;
Abschlussprüfung: 12/2013.
Zusätzliche Informationen
M. Pimmer:
"A timeslot-based heuristic approach to construct high-school timetables";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2010;
Abschlussprüfung: 12/2010.
Zusätzliche Informationen
A. Pinter:
"Balancing bike sharing systems";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik and Algorithmen,
2013;
Abschlussprüfung: 12/2013.
Zusätzliche Informationen
S. Pirkwieser:
"A Lagrangian decomposition approach combined with metaheuristics for the knapsack constrained maximum spanning tree problem.";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2006;
Abschlussprüfung: 10/2006.
A. Potocka:
"Webbasierte Darstellung großer Datenmengen als pivot-tabelle mithilfe ressourcenoptimierter Aggregationsverfahren";
Betreuer/in(nen): G. Raidl, M. Gruber;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 10/2008.
Zusätzliche Informationen
S. Pourmanouchehri:
"A Hybrid Evolutionary Algorithm for the Vehicle Routing Problem with Stochastic Demands";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2016;
Abschlussprüfung: 01.09.2016.
Zusätzliche Informationen
M. Prandtstetter:
"Exact and heuristic methods for solving the car sequencing problem.";
Betreuer/in(nen): G. Raidl, B. Hu;
Institut für Computergraphik und Algorithmen,
2005.
M. Prischink:
"Metaheuristics for the Districting and Routing Problem for Security Control";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2016;
Abschlussprüfung: 09.05.2016.
Zusätzliche Informationen
J. Puchinger:
"Verfahren zur Lösung eines Glasverschnittproblems";
Betreuer/in(nen): G. Raidl, G. Kodydek;
Institut für Computergraphik und Algorithmen - E186,
2003.
P. Putz:
"Subgradient optimization based lagrangian relaxation and relax-and-cut approaches for the bounded-diameter minimum spanning tree problem";
Betreuer/in(nen): G. Raidl, M. Gruber;
Institut für Computergraphik und Algorithmen,
2007;
Abschlussprüfung: 10/2007.
Zusätzliche Informationen
M. Putzenlechner:
"Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik and Algorithmen,
2013;
Abschlussprüfung: 08/2013.
Zusätzliche Informationen
U. Rietzinger:
"Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpräferenzen";
Betreuer/in(nen): G. Raidl, M. Prandtstetter;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 12/2008.
Zusätzliche Informationen
C. Schauer:
"Reconstructing cross-cut shredded documents by means of evolutionary algorithms";
Betreuer/in(nen): G. Raidl, M. Prandtstetter;
Institut für Computergraphik und Algorithmen,
2010;
Abschlussprüfung: 05/2010.
Zusätzliche Informationen
T. Schnabl:
"Critical Links Detection using CUDA";
Betreuer/in(nen): G. Raidl, B. Hu;
Institut für Computergraphik and Algorithmen,
2013;
Abschlussprüfung: 04/2013.
Zusätzliche Informationen
P. Schüller:
"Reconstructing borders of manually torn paper scheets using integer linear programming";
Betreuer/in(nen): G. Raidl, M. Prandtstetter;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 01/2008.
Zusätzliche Informationen
R. Schuster:
"Clustering Heuristics for the Hierarchical Ring Network Problem";
Betreuer/in(nen): G. Raidl, C. Schauer;
Institut für Computergraphik und Algorithmen,
2011;
Abschlussprüfung: 11/2011.
Zusätzliche Informationen
C. Schwab:
"Visibility-Based Obstacle Placing";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2016;
Abschlussprüfung: 11.02.2016.
Zusätzliche Informationen
T. Seidl:
"A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem";
Betreuer/in(nen): G. Raidl, M. Ruthmair;
Institut für Computergraphik und Algorithmen,
2011;
Abschlussprüfung: 09/2011.
Zusätzliche Informationen
M. Sinnl:
"Branch-and-price for the Steiner tree problem with revenues, budget and hop constraints";
Betreuer/in(nen): G. Raidl, M. Leitner;
Institut für Computergraphik und Algorithmen,
2011;
Abschlussprüfung: 08/2011.
Zusätzliche Informationen
M. Sonnleitner:
"Ein neues lösungsarchiv für das generalized minimum spanning tree-problem";
Betreuer/in(nen): G. Raidl, B. Hu;
Institut für Computergraphik und Algorithmen,
2010;
Abschlussprüfung: 09/2010.
A. Sramko:
"Enhancing a genetic algorithm by a complete solution archive based on a trie data structure";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2009;
Abschlussprüfung: 02/2009.
Zusätzliche Informationen
M. Sturm:
"Solving multimodal resource constrained project scheduling problems";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2012;
Abschlussprüfung: 09/2012.
Zusätzliche Informationen
M. Suntinger:
"Event based similarity search and its applications in business analytics";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2009;
Abschlussprüfung: 03/2009.
Zusätzliche Informationen
S. Teuschl:
"Casual Employee Scheduling with Constraint Programming and Metaheuristics";
Betreuer/in(nen): G. Raidl, N. Frohner;
Institute of Logic and Computation,
2020;
Abschlussprüfung: 11/2020.
Zusätzliche Informationen
C. Thöni:
"Compressing fingerprint templates by solving the $k$-node minimum label spanning arborescence problem by branch-and-price";
Betreuer/in(nen): G. Raidl, A Chwatal;
Institut für Computergraphik und Algorithmen,
2010;
Abschlussprüfung: 02/2010.
Zusätzliche Informationen
D. Trummer:
"Applying ant colony optimization to the periodic vehicle routing problem with time windows.";
Betreuer/in(nen): G. Raidl;
Computergraphik und Algorithmen,
2014.
Zusätzliche Informationen
A. Tus:
"Heuristic solution approaches for the two dimensional pre-marshalling problem.";
Betreuer/in(nen): G. Raidl, A. Rendl;
Institut für Computergrafik und Algorithmen,
2014.
Zusätzliche Informationen
J. Varga:
"Computational Methods for Fleet Scheduling in E-Mobility";
Betreuer/in(nen): G. Raidl;
Institute of Logic and Computation,
2021;
Abschlussprüfung: 16.08.2021.
Zusätzliche Informationen
G. Verlut:
"An application of Dijkstra's algorithm for a (on-board) route (re-)planning module.";
Betreuer/in(nen): G. Raidl, J. Puchinger;
Institut für Computergraphik und Algorithmen,
2005.
C. Volko:
"Selective Graph Coloring Problem";
Betreuer/in(nen): G. Raidl, B. Hu;
Institut für Computergraphik and Algorithmen,
2013;
Abschlussprüfung: 04/2013.
Zusätzliche Informationen
D. Wagner:
"Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem.";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2005.
J. Walla:
"Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing";
Betreuer/in(nen): G. Raidl, M. Ruthmair;
Institut für Computergraphik und Algorithmen,
2009.
Zusätzliche Informationen
A. Windbichler:
"A Heuristic Approach to Aircraft Trajectory Optimization with Constraints";
Betreuer/in(nen): G. Raidl;
Institute of Logic and Computation,
2019;
Abschlussprüfung: 13.03.2019.
Zusätzliche Informationen
T. Winkler:
"Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten";
Betreuer/in(nen): G. Raidl, C. Schauer;
Institut für Computergraphik und Algorithmen,
2011;
Abschlussprüfung: 07/2011.
Zusätzliche Informationen
M. Wolf:
"Ein lösungsarchiv-unterstützter evolutionärer algorithmus für das generalized minimum spanning tree-problem";
Betreuer/in(nen): G. Raidl, B. Hu;
Institute of Computer Graphics and Algorithms,
2009.
Zusätzliche Informationen
F. Zaubzer:
"Lagrangian relax-and-cut and hybrid methods for the bounded diameter and the hop constrained minimum spanning tree problems";
Betreuer/in(nen): G. Raidl, M. Gruber;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 05/2008.
Zusätzliche Informationen
S. Zaubzer:
"A complete archive genetic algorithm for the multidimensional knapsack problem";
Betreuer/in(nen): G. Raidl;
Institut für Computergraphik und Algorithmen,
2008;
Abschlussprüfung: 05/2008.
Zusätzliche Informationen
Wissenschaftliche Berichte
B. Hu, M. Leitner, G. Raidl:
"Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem.";
Bericht für Journal of Heuristics;
Berichts-Nr. Technical Report TR 186-1-06-01,
2006;
36 S.
M. Prandtstetter, G. Raidl:
"A variable neihborhood search approach for solving the car sequencing problem.";
Bericht für European Journal of Operations Research (EJOR);
2005;
24 S.
J. Puchinger, G. Raidl:
"Bringing order into the neighborhoods: Relaxation guided variable neighborhood search.";
Bericht für submitted to Journal of Heuristics.;
Berichts-Nr. TR 186-1-06-02,
2006;
33 S.
J. Puchinger, G. Raidl:
"Models and algorithms for three-stage two-dimensional bin packing.";
Bericht für Technical Report TR 186-1-04-04, submitted to EJOR;
2004.
J. Puchinger, G. Raidl:
"Models and algorithms for three-stage two-dimensional bin packing.";
Bericht für European Journal of Operations Research, Feature Issue on Cutting and Packing;
2006;
33 S.
G. Raidl:
"Hybrid Metaheuristics for Optimization Problems in Public Bike Sharing Systems";
2017.
Zusätzliche Informationen
G. Raidl, J. Gottlieb:
"Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. ";
Bericht für Technischer Report TR 186-1-04-05;
2004.
G. Raidl, G. Koller, B. Julstrom:
"Biased mutation operators for subgraph-selection problems. ";
Bericht für Technischer Report TR 186-1-04-06;
2004.
