Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGünther R. Raidl
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c146]Thomas Jatschka, Tobias Rodemann, Günther R. Raidl:
A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning. EvoCOP 2023: 50-65- [c145]Rupert Ettrich, Marc Huber, Günther R. Raidl:
A Policy-Based Learning Beam Search for Combinatorial Optimization. EvoCOP 2023: 130-145 - [c144]Steffen Limmer
, Johannes Varga, Günther R. Raidl:
An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles. EvoApplications@EvoStar 2023: 3-18 - [c143]Nikolaus Frohner, Günther R. Raidl, Francisco Chicano:
Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines. GECCO Companion 2023: 1941-1949 - [c142]Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann:
Interactive Job Scheduling with Partially Known Personnel Availabilities. OLA 2023: 236-247 - [i2]Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl:
Signed double Roman domination on cubic graphs. CoRR abs/2308.01109 (2023) - 2022
- [j51]Johannes Varga, Günther R. Raidl, Steffen Limmer:
Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet. IEEE Access 10: 105786-105806 (2022) - [j50]Marko Djukanovic, Aleksandar Kartelj, Dragan Matic, Milana Grbic, Christian Blum, Günther R. Raidl:
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Appl. Soft Comput. 122: 108844 (2022) - [c141]Fabio F. Oberweger, Günther R. Raidl, Elina Rönnberg, Marc Huber:
A Learning Large Neighborhood Search for the Staff Rerostering Problem. CPAIOR 2022: 300-317 - [c140]Marc Huber, Günther R. Raidl:
A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem. EUROCAST 2022: 87-95 - [c139]Thomas Jatschka, Matthias Rauscher, Bernhard Kreutzer, Yusuke Okamoto, Hiroaki Kataoka, Tobias Rodemann, Günther R. Raidl:
A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters. EUROCAST 2022: 121-129 - [c138]Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl:
A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation. EvoCOP 2022: 127-142 - [c137]Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi:
Parallel Beam Search for Combinatorial Optimization. ICPP Workshops 2022: 21:1-21:8 - [c136]Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi:
Parallel Beam Search for Combinatorial Optimization (Extended Abstract). SOCS 2022: 273-275 - 2021
- [j49]Thomas Jatschka, Günther R. Raidl, Tobias Rodemann:
A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. Algorithms 14(8): 232 (2021) - [j48]Matthias Horn, Günther R. Raidl, Elina Rönnberg:
A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources. Ann. Oper. Res. 302(2): 477-505 (2021) - [j47]Johannes Maschler, Günther R. Raidl:
Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources. Ann. Oper. Res. 302(2): 507-531 (2021) - [j46]Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl:
Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. 125: 105089 (2021) - [j45]Matthias Horn, Johannes Maschler, Günther R. Raidl, Elina Rönnberg:
A∗-based construction of decision diagrams for a prize-collecting scheduling problem. Comput. Oper. Res. 126: 105125 (2021) - [j44]Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum:
An A⁎ search algorithm for the constrained longest common subsequence problem. Inf. Process. Lett. 166: 106041 (2021) - [c135]Matthias Horn, Günther R. Raidl:
A*-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem. CPAIOR 2021: 72-88 - [c134]Adrian Bracher, Nikolaus Frohner, Günther R. Raidl:
Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems. CPAIOR 2021: 283-298 - [c133]Marc Huber, Günther R. Raidl:
Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems. LOD 2021: 283-298 - 2020
- [j43]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three. Appl. Math. Comput. 380: 125233 (2020) - [j42]Marko Djukanovic, Günther R. Raidl, Christian Blum:
Finding Longest Common Subsequences: New anytime A∗ search results. Appl. Soft Comput. 95: 106499 (2020) - [j41]Marko Djukanovic, Günther R. Raidl, Christian Blum:
Anytime algorithms for the longest common palindromic subsequence problem. Comput. Oper. Res. 114 (2020) - [j40]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
A model for finding transition-minors. Discret. Appl. Math. 283: 242-264 (2020) - [j39]Johannes Maschler, Günther R. Raidl:
Particle therapy patient scheduling with limited starting time variations of daily treatments. Int. Trans. Oper. Res. 27(1): 458-479 (2020) - [j38]Martin Riedler, Thomas Jatschka, Johannes Maschler, Günther R. Raidl:
An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem. Int. Trans. Oper. Res. 27(1): 573-613 (2020) - [c132]Nikolaus Frohner, Bernhard Neumann, Günther R. Raidl:
A Beam Search Approach to the Traveling Tournament Problem. EvoCOP 2020: 67-82 - [c131]Nikolaus Frohner, Matthias Horn, Günther R. Raidl:
Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines⁎. ISM 2020: 366-370 - [c130]Matthias Horn, Nikolaus Frohner, Günther R. Raidl:
Driver Shift Planning for an Online Store with Short Delivery Times. ISM 2020: 517-524 - [c129]Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum:
On Solving a Generalized Constrained Longest Common Subsequence Problem. OPTIMA 2020: 55-70 - [c128]Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl:
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. OPTIMA 2020: 134-149 - [c127]Thomas Jatschka, Fabio F. Oberweger, Tobias Rodemann, Günther R. Raidl:
Distributing Battery Swapping Stations for Electric Scooters in an Urban Area. OPTIMA 2020: 150-165 - [c126]Thomas Kaufmann, Matthias Horn, Günther R. Raidl:
A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem. PPSN (2) 2020: 385-398
2010 – 2019
- 2019
- [j37]Matthias Horn, Günther R. Raidl, Christian Blum:
Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm. Artif. Intell. 277 (2019) - [c125]Christian Blum, Dhananjay R. Thiruvady, Andreas T. Ernst, Matthias Horn, Günther R. Raidl:
A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem. Australasian Conference on Artificial Intelligence 2019: 549-560 - [c124]Thomas Jatschka, Tobias Rodemann, Günther R. Raidl:
VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points. EUROCAST (1) 2019: 255-262 - [c123]Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl:
Casual Employee Scheduling with Constraint Programming and Metaheuristics. EUROCAST (1) 2019: 279-287 - [c122]Matthias Horn, Günther R. Raidl:
Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem. EUROCAST (1) 2019: 344-351 - [c121]Marko Djukanovic, Günther R. Raidl, Christian Blum:
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. EUROCAST (1) 2019: 429-437 - [c120]Thomas Jatschka, Tobias Rodemann, Günther R. Raidl:
A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. EvoCOP 2019: 1-16 - [c119]Martin Riedler, Mario Ruthmair, Günther R. Raidl:
Strategies for Iteratively Refining Layered Graph Models. HM 2019: 46-62 - [c118]Nikolaus Frohner, Günther R. Raidl:
Towards Improving Merging Heuristics for Binary Decision Diagrams. LION 2019: 30-45 - [c117]Christian Kloimüllner, Günther R. Raidl:
A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems. LION 2019: 184-200 - [c116]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
A SAT Approach for Finding Sup-Transition-Minors. LION 2019: 325-341 - [c115]Marko Djukanovic, Günther R. Raidl, Christian Blum:
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. LOD 2019: 154-167 - [c114]Nikolaus Frohner, Günther R. Raidl:
Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers. LOD 2019: 445-457 - [c113]Thomas Jatschka, Tobias Rodemann, Günther R. Raidl:
Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. LOD 2019: 738-750 - [p5]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A Memetic Algorithm for Competitive Facility Location Problems. Business and Consumer Analytics: New Ideas 2019: 637-660 - 2018
- [j36]Martin Riedler, Günther R. Raidl:
Solving a selective dial-a-ride problem with logic-based Benders decomposition. Comput. Oper. Res. 96: 30-54 (2018) - [j35]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands. Transp. Sci. 52(3): 673-690 (2018) - [c112]Marko Djukanovic, Günther R. Raidl, Christian Blum:
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. LION 2018: 199-214 - 2017
- [j34]Christian Kloimüllner, Günther R. Raidl:
Full-load route planning for balancing bike sharing systems by logic-based benders decomposition. Networks 69(3): 270-289 (2017) - [j33]Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl:
Large neighborhood search for the most strings with few bad columns problem. Soft Comput. 21(17): 4901-4915 (2017) - [c111]Airam Expósito, Günther R. Raidl, Julio Brito, José A. Moreno-Pérez:
GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection. EUROCAST (1) 2017: 299-306 - [c110]Benedikt Klocker, Günther R. Raidl:
Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging. EUROCAST (1) 2017: 355-363 - [c109]Johannes Maschler, Martin Riedler, Günther R. Raidl:
Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments. EUROCAST (1) 2017: 364-372 - [c108]Bong-Min Kim, Christian Kloimüllner, Günther R. Raidl:
Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control. EvoCOP 2017: 91-107 - [c107]Christian Kloimüllner, Günther R. Raidl:
Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem. LION 2017: 150-165 - [c106]Matthias Horn, Günther R. Raidl, Christian Blum:
Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment. MOD 2017: 506-518 - [c105]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
Finding Smooth Graphs with Small Independence Numbers. MOD 2017: 527-539 - [c104]Christopher Bacher, Günther R. Raidl:
Refining Partial Invalidations for Indexed Algebraic Dynamic Programming. MOD 2017: 562-573 - 2016
- [b1]Christian Blum, Günther R. Raidl:
Hybrid Metaheuristics - Powerful Tools for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms, Springer 2016, ISBN 978-3-319-30882-1, pp. 1-136 - [j32]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
Models and algorithms for competitive facility location problems with different customer behavior. Ann. Math. Artif. Intell. 76(1-2): 93-119 (2016) - [j31]Christian Schauer, Günther R. Raidl:
A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design. Electron. Notes Discret. Math. 52: 189-196 (2016) - [j30]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands. Electron. Notes Discret. Math. 52: 245-252 (2016) - [j29]Hoong Chuin Lau, Günther R. Raidl, Pascal Van Hentenryck:
New developments in metaheuristics and their applications - Selected extended contributions from the 10th Metaheuristics International Conference (MIC 2013). J. Heuristics 22(4): 359-363 (2016) - [j28]Johannes Inführ, Günther R. Raidl:
A memetic algorithm for the virtual network mapping problem. J. Heuristics 22(4): 475-505 (2016) - [j27]Christian Blum, Günther R. Raidl:
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem. Optim. Lett. 10(1): 189-205 (2016) - [c103]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. HM 2016: 1-16 - [c102]Michael Prischink, Christian Kloimüllner, Benjamin Biesinger, Günther R. Raidl:
Districting and Routing for Security Control. HM 2016: 87-103 - 2015
- [j26]Gerhard Hiermann, Matthias Prandtstetter, Andrea Rendl, Jakob Puchinger, Günther R. Raidl:
Metaheuristics for solving a multimodal home-healthcare scheduling problem. Central Eur. J. Oper. Res. 23(1): 89-113 (2015) - [j25]Frederico Dusberger, Günther R. Raidl:
Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search. Electron. Notes Discret. Math. 47: 133-140 (2015) - [j24]Igor Grujicic, Günther R. Raidl, Andreas Schöbel:
Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure. Electron. Notes Discret. Math. 47: 141-148 (2015) - [j23]Günther R. Raidl, Thomas Baumhauer, Bin Hu:
Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search. Electron. Notes Discret. Math. 47: 149-156 (2015) - [j22]Günther R. Raidl:
Decomposition based hybrid metaheuristics. Eur. J. Oper. Res. 244(1): 66-76 (2015) - [j21]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem. J. Heuristics 21(3): 391-431 (2015) - [j20]Marian Rainer-Harbach, Petrina Papazek, Günther R. Raidl, Bin Hu, Christian Kloimüllner:
PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. J. Glob. Optim. 63(3): 597-629 (2015) - [c101]Christian Schauer, Günther R. Raidl:
On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi Layer Hierarchical Ring Network Design Problem. EUROCAST 2015: 271-278 - [c100]Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl:
Heuristic Approaches for the Probabilistic Traveling Salesman Problem. EUROCAST 2015: 342-349 - [c99]Frederico Dusberger, Günther R. Raidl:
A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size. EUROCAST 2015: 384-392 - [c98]David Markvica, Christian Schauer, Günther R. Raidl:
CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem. EUROCAST 2015: 401-408 - [c97]Christopher Bacher, Günther R. Raidl, Thorsten Krenek:
A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles. EUROCAST 2015: 425-432 - [c96]Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther R. Raidl:
A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems. EUROCAST 2015: 439-446 - [c95]Bin Hu, Andreas Windbichler, Günther R. Raidl:
A New Solution Representation for the Firefighter Problem. EvoCOP 2015: 25-35 - [c94]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands. EvoCOP 2015: 48-60 - [c93]Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl:
On solving the most strings with few bad columns problem: An ILP model and heuristics. INISTA 2015: 1-8 - [c92]Alan Tus, Andrea Rendl, Günther R. Raidl:
Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem. LION 2015: 186-201 - [c91]Frederico Dusberger, Günther R. Raidl:
A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem. OR 2015: 385-391 - [c90]Johannes Maschler, Günther R. Raidl:
A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem. OR 2015: 393-399 - [i1]Christian Blum, Günther R. Raidl:
Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem. CoRR abs/1501.02388 (2015) - 2014
- [c89]Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. EvoCOP 2014: 73-84 - [c88]Christopher Bacher, Thorsten Krenek, Günther R. Raidl:
Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles. EvoApplications 2014: 553-564 - [c87]Frederico Dusberger, Günther R. Raidl:
A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. Hybrid Metaheuristics 2014: 85-99 - [c86]Günther R. Raidl, Thomas Baumhauer, Bin Hu:
Speeding Up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem. Hybrid Metaheuristics 2014: 183-197 - [c85]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior. LION 2014: 203-217 - [c84]Petrina Papazek, Christian Kloimüllner, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid. PPSN 2014: 792-801 - [c83]Christian Schauer, Günther R. Raidl:
A Memetic Algorithm for Multi Layer Hierarchical Ring Network Design. PPSN 2014: 832-841 - 2013
- [j19]Markus Leitner, Mario Ruthmair, Günther R. Raidl:
Stabilizing branch-and-price for constrained tree problems. Networks 61(2): 150-170 (2013) - [c82]Petrica C. Pop, Bin Hu, Günther R. Raidl:
A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. EUROCAST (1) 2013: 219-226 - [c81]Petrina Papazek, Günther R. Raidl, Marian Rainer-Harbach, Bin Hu:
A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems. EUROCAST (1) 2013: 372-379 - [c80]Benjamin Biesinger, Christian Schauer, Bin Hu, Günther R. Raidl:
Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents. EUROCAST (1) 2013: 380-387 - [c79]Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach. EvoCOP 2013: 121-132 - [c78]Johannes Inführ, Günther R. Raidl:
Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent. EvoCOP 2013: 250-261 - [c77]Günther R. Raidl, Bin Hu, Marian Rainer-Harbach, Petrina Papazek:
Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations. Hybrid Metaheuristics 2013: 130-143 - [c76]Johannes Inführ, Günther R. Raidl:
GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem. Hybrid Metaheuristics 2013: 159-173 - [c75]Johannes Inführ, David Stezenbach, Matthias Hartmann, Kurt Tutschku, Günther R. Raidl:
Using Optimized Virtual Network Embedding for Network Dimensioning. NetSys 2013: 118-125 - 2012
- [j18]Clemens Nothegger, Alfred Mayer, Andreas M. Chwatal, Günther R. Raidl:
Solving the post enrolment course timetabling problem by ant colony optimization. Ann. Oper. Res. 194(1): 325-339 (2012) - [c74]Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger, Günther R. Raidl:
Hybrid Heuristics for Multimodal Homecare Scheduling. CPAIOR 2012: 339-355 - [c73]Martin Schwengerer, Sandro Pirkwieser, Günther R. Raidl:
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem. EvoCOP 2012: 13-24 - [c72]Thorsten Krenek, Mario Ruthmair, Günther R. Raidl, Michael Planer:
Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles. EvoApplications 2012: 376-385 - [c71]Bin Hu, Günther R. Raidl:
An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. GECCO 2012: 393-400 - [c70]Mario Ruthmair, Günther R. Raidl:
On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem. ISCO 2012: 225-236