b'Jakob Bossek'

DeepAI AI Chat

Featured Co-authors

Frank Neumann
109 publications
Bernd Bischl
93 publications
Carola Doerr
90 publications
Aneta Neumann
52 publications
Joaquin Vanschoren
43 publications
Markus Wagner
42 publications
Jason H. Moore
40 publications
Dirk Sudholt
31 publications
Thomas Bartz-Beielstein
28 publications
Tome Eftimov
27 publications
Pan Peng
26 publications

research

∙ 05/31/2023

On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem

We contribute to the efficient approximation of the Pareto-set for the c...

0 Jakob Bossek, et al. ∙

research

∙ 05/30/2023

Runtime Analysis of Quality Diversity Algorithms

Quality diversity (QD) is a branch of evolutionary computation that gain...

0 Jakob Bossek, et al. ∙

research

∙ 05/30/2023

On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem

Evolutionary algorithms have been shown to obtain good solutions for com...

0 Jakob Bossek, et al. ∙

research

∙ 07/28/2022

Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem

Recently different evolutionary computation approaches have been develop...

5 Adel Nikfarjam, et al. ∙

research

∙ 02/04/2022

Exploring the Feature Space of TSP Instances Using Quality Diversity

Generating instances of different properties is key to algorithm selecti...

0 Jakob Bossek, et al. ∙

research

∙ 08/11/2021

Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation

Evolutionary algorithms based on edge assembly crossover (EAX) constitut...

6 Adel Nikfarjam, et al. ∙

research

∙ 06/14/2021

Exact Counting and Sampling of Optima for the Knapsack Problem

Computing sets of high quality solutions has gained increasing interest ...

0 Jakob Bossek, et al. ∙

research

∙ 05/26/2021

Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem

We contribute to the theoretical understanding of randomized search heur...

0 Jakob Bossek, et al. ∙

research

∙ 04/28/2021

Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem

Computing diverse sets of high-quality solutions has gained increasing a...

12 Adel Nikfarjam, et al. ∙

research

∙ 04/27/2021

Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms

In practise, it is often desirable to provide the decision-maker with a ...

3 Jakob Bossek, et al. ∙

research

∙ 10/22/2020

Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems

Submodular functions allow to model many real-world optimisation problem...

9 Aneta Neumann, et al. ∙

research

∙ 10/21/2020

Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem

In the area of evolutionary computation the calculation of diverse sets ...

0 Jakob Bossek, et al. ∙

research

∙ 07/07/2020

Benchmarking in Optimization: Best Practice and Open Issues

This survey compiles ideas and recommendations from more than a dozen re...

11 Thomas Bartz-Beielstein, et al. ∙

research

∙ 06/29/2020

Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem

In this work we focus on the well-known Euclidean Traveling Salesperson ...

9 Moritz Seiler, et al. ∙

research

∙ 06/05/2020

Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions

The Traveling Salesperson Problem (TSP) is one of the best-known combina...

1 Jakob Bossek, et al. ∙

research

∙ 05/28/2020

Dynamic Bi-Objective Routing of Multiple Vehicles

In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Pro...

0 Jakob Bossek, et al. ∙

research

∙ 05/28/2020

Towards Decision Support in Dynamic Bi-Objective Vehicle Routing

We consider a dynamic bi-objective vehicle routing problem, where a subs...

0 Jakob Bossek, et al. ∙

research

∙ 05/28/2020

More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization

Dynamic optimization problems have gained significant attention in evolu...

10 Jakob Bossek, et al. ∙

research

∙ 05/27/2020

Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection

The Traveling-Salesperson-Problem (TSP) is arguably one of the best-know...

5 Jakob Bossek, et al. ∙

research

∙ 04/22/2020

Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem

Evolutionary algorithms (EAs) are general-purpose problem solvers that u...

7 Vahid Roostapour, et al. ∙

research

∙ 04/20/2020

Evolving Diverse Sets of Tours for the Travelling Salesperson Problem

Evolving diverse sets of high quality solutions has gained increasing in...

21 Anh Viet Do, et al. ∙

research

∙ 03/30/2020

Initial Design Strategies and their Effects on Sequential Model-Based Optimization

Sequential model-based optimization (SMBO) approaches are algorithms for...

3 Jakob Bossek, et al. ∙

research

∙ 02/04/2020

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics

Several important optimization problems in the area of vehicle routing c...

2 Jakob Bossek, et al. ∙

research

∙ 12/19/2019

One-Shot Decision-Making with and without Surrogates

One-shot decision making is required in situations in which we can evalu...

20 Jakob Bossek, et al. ∙

research

∙ 03/09/2017

mlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions

We present mlrMBO, a flexible and comprehensive R toolbox for model-base...

0 Bernd Bischl, et al. ∙

research

∙ 01/05/2017

OpenML: An R Package to Connect to the Machine Learning Platform OpenML

OpenML is an online machine learning platform where researchers can easi...

0 Giuseppe Casalicchio, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world