( en | de | ru )

 

Disambiguation of "Bossek, Jakob"

Author of the publication

copydeleteadd this publication to your clipboard
On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem.

, , and . CoRR, (2023)

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)

Alfons Jakob

Wolfgang Jakob

 

Other publications of authors with the same name

Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem., and . CoRR, (2020)ecr 2.0: a modular framework for evolutionary computation in R.. GECCO (Companion), page 1187-1193. ACM, (2017)Performance assessment of multi-objective evolutionary algorithms with the R package ecr.. GECCO (Companion), page 1350-1356. ACM, (2018)Initial Design Strategies and their Effects on Sequential Model-Based Optimization., , and . CoRR, (2020)On the benefits of biased edge-exchange mutation for the multi-criteria spanning tree problem., , and . GECCO, page 516-523. ACM, (2019)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)Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems., and . LION, volume 11353 of Lecture Notes in Computer Science, page 184-198. Springer, (2018)On the potential of automated algorithm configuration on multi-modal multi-objective optimization problems., , , and . GECCO Companion, page 356-359. ACM, (2022)Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space., , , , and . GECCO, page 312-320. ACM, (2023)Exact Counting and Sampling of Optima for the Knapsack Problem., , and . LION, volume 12931 of Lecture Notes in Computer Science, page 40-54. Springer, (2021)