( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search.

, и . Electron. Notes Discret. Math., (2015)

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.

Christof Raidl

Monika Raidl-Dengler

Franz Raidl

Rudolf Raidl

Rudolf Raidl

 

Другие публикации лиц с тем же именем

Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm., , и . Artif. Intell., (2019)A model for finding transition-minors., , и . Discret. Appl. Math., (2020)Finding Longest Common Subsequences: New anytime A∗ search results., , и . Appl. Soft Comput., (2020)Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search., , и . Electron. Notes Discret. Math., (2015)An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem., и . Eur. J. Oper. Res., 191 (3): 1004-1022 (2008)Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem., , и . LION, том 11353 из Lecture Notes in Computer Science, стр. 199-214. Springer, (2018)Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms., и . GECCO, стр. 323-330. ACM, (2008)Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO., , и . GECCO, стр. 1187-1194. ACM, (2006)Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows., и . Hybrid Metaheuristics, том 5818 из Lecture Notes in Computer Science, стр. 45-59. Springer, (2009)A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents., , и . Hybrid Metaheuristics, том 6373 из Lecture Notes in Computer Science, стр. 103-117. Springer, (2010)