( en | de | ru )

 

Disambiguation of "Bossek, Jakob"

Author of the publication

copydeleteadd this publication to your clipboard
Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem.

, , and . GECCO, page 551-559. ACM, (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.

Hubert Bossek

Franz Michael Jakob

Zytotoxizität von Ozon und dessen Einfluss auf das NF-_k63B-System NF-kappaB-System. Uni München, (2009)

Jakob Assmann

Trust and communication in virtual teams. Uni München, (2009)

Peter Jakob

Silke Jakobi

 

Other publications of authors with the same name

Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem., , , and . CoRR, (2021)Benchmarking in Optimization: Best Practice and Open Issues., , , , , , , , , and 5 other author(s). CoRR, (2020)A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms., , and . Appl. Soft Comput., (2020)On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem., and . CoRR, (2023)Co-evolutionary Diversity Optimisation for the Traveling Thief Problem., , , and . PPSN (1), volume 13398 of Lecture Notes in Computer Science, page 237-249. Springer, (2022)Entropy-based evolutionary diversity optimisation for the traveling salesperson problem., , , and . GECCO, page 600-608. ACM, (2021)Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection., , and . CEC, page 1-8. IEEE, (2020)Parameterization of state-of-the-art performance indicators: a robustness study based on inexact TSP solvers., , and . GECCO (Companion), page 1737-1744. ACM, (2018)The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics., , , and . GECCO, page 1286-1294. ACM, (2020)Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference., and . AI*IA, volume 10037 of Lecture Notes in Computer Science, page 3-12. Springer, (2016)