
Exact Counting and Sampling of Optima for the Knapsack Problem
Computing sets of high quality solutions has gained increasing interest ...
read it

Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
We contribute to the theoretical understanding of randomized search heur...
read it

EntropyBased Evolutionary Diversity Optimisation for the Traveling Salesperson Problem
Computing diverse sets of highquality solutions has gained increasing a...
read it

Breeding Diverse Packings for the Knapsack Problem by Means of DiversityTailored Evolutionary Algorithms
In practise, it is often desirable to provide the decisionmaker with a ...
read it

Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems
Submodular functions allow to model many realworld optimisation problem...
read it

Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem
In the area of evolutionary computation the calculation of diverse sets ...
read it

Benchmarking in Optimization: Best Practice and Open Issues
This survey compiles ideas and recommendations from more than a dozen re...
read it

Deep Learning as a Competitive FeatureFree Approach for Automated Algorithm Selection on the Traveling Salesperson Problem
In this work we focus on the wellknown Euclidean Traveling Salesperson ...
read it

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 bestknown combina...
read it

Dynamic BiObjective Routing of Multiple Vehicles
In practice, e.g. in delivery and service scenarios, VehicleRoutingPro...
read it

Towards Decision Support in Dynamic BiObjective Vehicle Routing
We consider a dynamic biobjective vehicle routing problem, where a subs...
read it

More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization
Dynamic optimization problems have gained significant attention in evolu...
read it

Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection
The TravelingSalespersonProblem (TSP) is arguably one of the bestknow...
read it

Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the MultiObjective Minimum Spanning Tree Problem
Evolutionary algorithms (EAs) are generalpurpose problem solvers that u...
read it

Evolving Diverse Sets of Tours for the Travelling Salesperson Problem
Evolving diverse sets of high quality solutions has gained increasing in...
read it

Initial Design Strategies and their Effects on Sequential ModelBased Optimization
Sequential modelbased optimization (SMBO) approaches are algorithms for...
read it

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics
Several important optimization problems in the area of vehicle routing c...
read it

OneShot DecisionMaking with and without Surrogates
Oneshot decision making is required in situations in which we can evalu...
read it

mlrMBO: A Modular Framework for ModelBased Optimization of Expensive BlackBox Functions
We present mlrMBO, a flexible and comprehensive R toolbox for modelbase...
read it

OpenML: An R Package to Connect to the Machine Learning Platform OpenML
OpenML is an online machine learning platform where researchers can easi...
read it
Jakob Bossek
is this you? claim profile