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]

Authors

Frank Neumann 0001

This author has not been identified. Look up 'Frank Neumann 0001' in Google

Andrew M. Sutton

This author has not been identified. Look up 'Andrew M. Sutton' in Google