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

DOI10.1145/3299904.3340315zbMATH Open1433.68649OpenAlexW2969604833MaRDI QIDQ5215488FDOQ5215488

Authors: F. 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

Recommendations

• Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
• Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
• Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem
• scientific article; zbMATH DE number 6019547
• Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
• Evolutionary algorithms for knapsack problems
• Runtime analysis of the \((1+1)\) evolutionary algorithm on strings over finite alphabets
• scientific article; zbMATH DE number 1617337

zbMATH Keywords

knapsack problemevolutionary algorithmschance-constrained optimization

Mathematics Subject Classification ID

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

Cited In (1)

• Evolutionary bi-objective optimization for the dynamic chance-constrained knapsack problem based on tail bound objectives

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215488)