Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights

10 February 2021

Papers citing "Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights"

8 / 8 papers shown

Title
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem Feng Shi Xiankun Yan Frank Neumann Frank Neumann 132 0 0 22 Dec 2022
Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem Yue Xie Aneta Neumann Frank Neumann 69 32 0 07 Apr 2020
Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives Hirad Assimi Oscar Harper Yue Xie Aneta Neumann Frank Neumann 39 20 0 17 Feb 2020
Optimization of Chance-Constrained Submodular Functions Benjamin Doerr Carola Doerr Aneta Neumann Frank Neumann Andrew M. Sutton 46 32 0 26 Nov 2019
Pareto Optimization for Subset Selection with Dynamic Cost Constraints Vahid Roostapour Aneta Neumann Frank Neumann Tobias Friedrich 43 73 0 14 Nov 2018
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments Vahid Roostapour M. Pourhassan Frank Neumann 48 26 0 22 Jun 2018
A Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem Jun He B. Mitavskiy Yuren Zhou 64 16 0 14 Apr 2014
General Drift Analysis with Tail Bounds Per Kristian Lehre Carsten Witt 58 43 0 09 Jul 2013