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

Frank Neumann 0001, Andrew M. Sutton. Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. In Tobias Friedrich 0001, Carola Doerr, Dirk V. Arnold, editors, Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2019, Potsdam, Germany, August 27-29, 2019. pages 147-153, ACM, 2019. [doi]

Abstract

Abstract is missing.