( en | de | ru )

 

Disambiguation of "Raidl, Günther R."

Author of the publication

copydeleteadd this publication to your clipboard
Anytime algorithms for the longest common palindromic subsequence problem.

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

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

Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers., and . LOD, volume 11943 of Lecture Notes in Computer Science, page 445-457. Springer, (2019)A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation., , and . LOD, volume 11943 of Lecture Notes in Computer Science, page 154-167. Springer, (2019)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)Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search., , and . Electron. Notes Discret. Math., (2015)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)Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm., , and . Artif. Intell., (2019)An improved hybrid genetic algorithm for the generalized assignment problem., and . SAC, page 990-995. ACM, (2004)Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges., and . SAC, page 547-552. ACM, (2002)Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms., and . GECCO, page 323-330. ACM, (2008)