Optimization of Chance-Constrained Submodular Functions

26 November 2019

Papers citing "Optimization of Chance-Constrained Submodular Functions"

8 / 8 papers shown

Title
3-Objective Pareto Optimization for Problems with Chance Constraints Frank Neumann Carsten Witt 26 5 0 18 Apr 2023
Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler Frank Neumann Aneta Neumann Chao Qian Viet Anh Do Jacob De Nobel Diederick Vermetten Saba Sadeghi Ahouei Furong Ye Hongya Wang Thomas Bäck 69 5 0 02 Feb 2023
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 122 2 0 11 Aug 2022
Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) Weijie Zheng Benjamin Doerr 120 43 0 16 Dec 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 51 19 0 10 Feb 2021
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization Benjamin Doerr Frank Neumann 64 34 0 30 Jun 2020
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings Vanja Doskoc Tobias Friedrich Andreas Göbel Frank Neumann Aneta Neumann Francesco Quinzan 66 3 0 15 Nov 2019