Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem

Bryant A. Julstrom. Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. In Hans-Georg Beyer, Una-May O Reilly, editors, Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005. pages 607-614, ACM, 2005. [doi]

@inproceedings{Julstrom05a,
  title = {Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem},
  author = {Bryant A. Julstrom},
  year = {2005},
  doi = {10.1145/1068009.1068111},
  url = {http://doi.acm.org/10.1145/1068009.1068111},
  researchr = {https://researchr.org/publication/Julstrom05a},
  cites = {0},
  citedby = {0},
  pages = {607-614},
  booktitle = {Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005},
  editor = {Hans-Georg Beyer and Una-May O Reilly},
  publisher = {ACM},
  isbn = {1-59593-010-8},
}