( en | de | ru )

 

Disambiguation of "Raidl, Günther R."

Author of the publication

copydeleteadd this publication to your clipboard
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics.

, and . EUROCAST, volume 5717 of Lecture Notes in Computer Science, page 665-672. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christof Raidl

Monika Raidl-Dengler

Rudolf Raidl

Franz Raidl

Rudolf Raidl

 

Other publications of authors with the same name

Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm., , and . Artif. Intell., (2019)Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem., , and . LION, volume 11353 of Lecture Notes in Computer Science, page 199-214. Springer, (2018)A model for finding transition-minors., , and . Discret. Appl. Math., (2020)Finding Longest Common Subsequences: New anytime A∗ search results., , and . Appl. Soft Comput., (2020)Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows., and . Hybrid Metaheuristics, volume 5818 of Lecture Notes in Computer Science, page 45-59. Springer, (2009)A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents., , and . Hybrid Metaheuristics, volume 6373 of Lecture Notes in Computer Science, page 103-117. Springer, (2010)Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics., and . EUROCAST, volume 5717 of Lecture Notes in Computer Science, page 665-672. Springer, (2009)Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments., , and . EUROCAST (1), volume 10671 of Lecture Notes in Computer Science, page 364-372. Springer, (2017)Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging., and . EUROCAST (1), volume 10671 of Lecture Notes in Computer Science, page 355-363. Springer, (2017)Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach., , , and . EvoCOP, volume 7832 of Lecture Notes in Computer Science, page 121-132. Springer, (2013)