Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights

Frank Neumann 0001, Andrew M. Sutton. Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. In Anne Auger, Carlos M. Fonseca, Nuno Lourenço 0002, Penousal Machado, Luís Paquete, Darrell Whitley, editors, Parallel Problem Solving from Nature - PPSN XV - 15th International Conference, Coimbra, Portugal, September 8-12, 2018, Proceedings, Part II. Volume 11102 of Lecture Notes in Computer Science, pages 141-152, Springer, 2018. [doi]

@inproceedings{0001S18-5,
  title = {Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights},
  author = {Frank Neumann 0001 and Andrew M. Sutton},
  year = {2018},
  doi = {10.1007/978-3-319-99259-4_12},
  url = {https://doi.org/10.1007/978-3-319-99259-4_12},
  researchr = {https://researchr.org/publication/0001S18-5},
  cites = {0},
  citedby = {0},
  pages = {141-152},
  booktitle = {Parallel Problem Solving from Nature - PPSN XV - 15th International Conference, Coimbra, Portugal, September 8-12, 2018, Proceedings, Part II},
  editor = {Anne Auger and Carlos M. Fonseca and Nuno Lourenço 0002 and Penousal Machado and Luís Paquete and Darrell Whitley},
  volume = {11102},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-99259-4},
}