Solving the 0/1 knapsack problem using an adaptive genetic algorithm
暂无分享,去创建一个
[1] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[2] Lars Vestergaard Kragelund. Solving a Timetabling Problem Using Hybrid Genetic Algorithms , 1997, Softw. Pract. Exp..
[3] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.
[4] S. A. Hussain,et al. Application of genetic algorithm for bin packing , 1997, Int. J. Comput. Math..
[5] Emanuel Falkenauer,et al. A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.
[6] R. Spillman. Solving large knapsack problems with a genetic algorithm , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.
[7] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] David S. L. Wei,et al. Computer Algorithms , 1998, Scalable Comput. Pract. Exp..
[10] S. Martello,et al. A New Algorithm for the 0-1 Knapsack Problem , 1988 .
[11] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[12] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.