( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
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)

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

Rudolf Raidl

 

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

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)An improved hybrid genetic algorithm for the generalized assignment problem., и . SAC, стр. 990-995. ACM, (2004)Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics., и . EUROCAST, том 5717 из Lecture Notes in Computer Science, стр. 665-672. Springer, (2009)Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging., и . EUROCAST (1), том 10671 из Lecture Notes in Computer Science, стр. 355-363. Springer, (2017)Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments., , и . EUROCAST (1), том 10671 из Lecture Notes in Computer Science, стр. 364-372. Springer, (2017)A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem.. SAC, стр. 291-296. ACM, (1999)Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges., и . SAC, стр. 547-552. ACM, (2002)