Pareto Optimization for Subset Selection with Dynamic Cost Constraints

14 November 2018

Papers citing "Pareto Optimization for Subset Selection with Dynamic Cost Constraints"

5 / 5 papers shown

Title
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms Chao Bian Yawen Zhou Mingxing Li Chao Qian 41 34 0 05 Jun 2023
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem Feng Shi Xiankun Yan Frank Neumann Frank Neumann 118 0 0 22 Dec 2022
Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions Chao Qian 29 23 0 12 Oct 2019
On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling Frank Neumann Carsten Witt 48 32 0 23 Apr 2015
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints Rishabh K. Iyer J. Bilmes 57 258 0 08 Nov 2013