On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems

Jens Gottlieb. On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems. In Egbert J. W. Boers, Jens Gottlieb, Pier Luca Lanzi, Robert E. Smith, Stefano Cagnoni, Emma Hart, Günther R. Raidl, H. Tijink, editors, Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings. Volume 2037 of Lecture Notes in Computer Science, pages 50-59, Springer, 2001. [doi]

@inproceedings{Gottlieb01:0,
  title = {On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems},
  author = {Jens Gottlieb},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2037/20370050.htm},
  tags = {rule-based},
  researchr = {https://researchr.org/publication/Gottlieb01%3A0},
  cites = {0},
  citedby = {0},
  pages = {50-59},
  booktitle = {Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings},
  editor = {Egbert J. W. Boers and Jens Gottlieb and Pier Luca Lanzi and Robert E. Smith and Stefano Cagnoni and Emma Hart and Günther R. Raidl and H. Tijink},
  volume = {2037},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-41920-9},
}