Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem

DOI10.1145/3299904.3340315zbMath1433.68649OpenAlexW2969604833MaRDI QIDQ5215488

Frank Neumann, Andrew M. Sutton

Publication date: 11 February 2020

Published in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3299904.3340315

zbMATH Keywords

knapsack problemevolutionary algorithmschance-constrained optimization

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

This page was built for publication: Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem