( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications.

, , и . EvoCOP, том 11452 из Lecture Notes in Computer Science, стр. 1-16. Springer, (2019)

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

Rudolf Raidl

Franz Raidl

Stefan Raidl

 

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

An improved hybrid genetic algorithm for the generalized assignment problem., и . SAC, стр. 990-995. ACM, (2004)Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges., и . SAC, стр. 547-552. ACM, (2002)A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents., , и . Hybrid Metaheuristics, том 6373 из Lecture Notes in Computer Science, стр. 103-117. Springer, (2010)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)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)A model for finding transition-minors., , и . Discret. Appl. Math., (2020)Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search., , и . Electron. Notes Discret. Math., (2015)A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem.. SAC, стр. 291-296. ACM, (1999)Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem., , и . LION, том 11353 из Lecture Notes in Computer Science, стр. 199-214. Springer, (2018)