From post

Using Experimental Design to Analyze Stochastic Local Search Algorithms for Multiobjective Problems.

, , и . Metaheuristics, том 39 из Operations Research/Computer Science Interfaces Series, Springer, (2007)

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.

 

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

A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem., , , , , , , , , и 2 other автор(ы). PATAT, том 2740 из Lecture Notes in Computer Science, стр. 329-354. Springer, (2002)Heuristic algorithms for Hadamard matrices with two circulant cores., , , и . Theor. Comput. Sci., 407 (1-3): 274-277 (2008)A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem., и . SEA², том 11544 из Lecture Notes in Computer Science, стр. 69-81. Springer, (2019)On the Computation of the Empirical Attainment Function., , , и . EMO, том 6576 из Lecture Notes in Computer Science, стр. 106-120. Springer, (2011)Local Search for Multiobjective Multiple Sequence Alignment., , и . IWBBIO (2), том 9044 из Lecture Notes in Computer Science, стр. 175-182. Springer, (2015)Using Experimental Design to Analyze Stochastic Local Search Algorithms for Multiobjective Problems., , и . Metaheuristics, том 39 из Operations Research/Computer Science Interfaces Series, Springer, (2007)Replicability and reproducibility in evolutionary optimization., и . GECCO Companion, стр. 454-462. ACM, (2021)Greedy Hypervolume Subset Selection in Low Dimensions., , и . Evol. Comput., 24 (3): 521-544 (2016)Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization., и . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization., , и . Experimental Methods for the Analysis of Optimization Algorithms, Springer, (2010)