A note on the performance of genetic algorithms on zero-one knapsack problems

Conference proceeding

V Gordon, A Böhm and Darrell Whitley

Proceedings of the 1994 ACM symposium on applied computing, Vol.129433, pp.194-195

SAC '94

04/06/1994

Handle:

https://hdl.handle.net/20.500.12741/rep:5699

Abstract

dataflow computing

zero-one knapsack

3 Record Views

Title: A note on the performance of genetic algorithms on zero-one knapsack problems
Creators: V Gordon
A Böhm
Darrell Whitley
Academic Unit: Computer Science Department
Publisher: ACM
Publication Details: 04/06/1994
Series: SAC '94
Identifiers: 99257847126001671; https://hdl.handle.net/20.500.12741/rep:5699; https://doi.org/10.1145/326619.326696
Language: English