Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives

17 February 2020

Papers citing "Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives"

6 / 6 papers shown

Title
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem Feng Shi Xiankun Yan Frank Neumann Frank Neumann 134 0 0 22 Dec 2022
Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions Frank Neumann Carsten Witt 127 2 0 11 Aug 2022
Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees Chao Qian Danqin Liu Zhi Zhou 38 14 0 18 Oct 2021
Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights Yue Xie Aneta Neumann Frank Neumann Andrew M. Sutton 59 19 0 10 Feb 2021
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization Benjamin Doerr Frank Neumann 67 34 0 30 Jun 2020
The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms Ragav Sachdeva Frank Neumann Markus Wagner 43 8 0 25 Apr 2020