( en | de | ru )

 

Disambiguation of "Raidl, Günther R."

Author of the publication

copydeleteadd this publication to your clipboard
Solving longest common subsequence problems via a transformation to the maximum clique problem.

, , , , , , and . Comput. Oper. Res., (2021)

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

Franz Raidl

Rudolf Raidl

Rudolf Raidl

 

Other publications of authors with the same name

Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges., and . SAC, page 547-552. ACM, (2002)An improved hybrid genetic algorithm for the generalized assignment problem., and . SAC, page 990-995. ACM, (2004)Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms., and . GECCO, page 323-330. ACM, (2008)Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO., , and . GECCO, page 1187-1194. ACM, (2006)An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem., and . Eur. J. Oper. Res., 191 (3): 1004-1022 (2008)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)A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem.. SAC, page 291-296. ACM, (1999)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)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)