Automatic generation of algorithms for the binary knapsack problem
暂无分享,去创建一个
[1] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..
[2] Graham Kendall,et al. Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.
[3] Daniel Bienstock,et al. Approximate formulations for 0-1 knapsack sets , 2008, Oper. Res. Lett..
[4] John R. Koza,et al. Genetic Programming IV: Routine Human-Competitive Machine Intelligence , 2003 .
[5] Majid Darehmiraki,et al. Molecular solution to the 0-1 knapsack problem based on DNA computing , 2007, Appl. Math. Comput..
[6] Riccardo Poli,et al. A Field Guide to Genetic Programming , 2008 .
[7] Stephan M. Winkler,et al. Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications , 2009 .
[8] Rajeev Kumar,et al. Assessing solution quality of biobjective 0-1 knapsack problem using evolutionary and heuristic algorithms , 2010, Appl. Soft Comput..
[9] Gerhard Wäscher,et al. An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..
[10] Maria Grazia Speranza,et al. Kernel search: A general heuristic for the multi-dimensional knapsack problem , 2010, Comput. Oper. Res..
[11] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[12] Michel Gendreau,et al. Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..
[13] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[14] David Pisinger,et al. Where are the hard knapsack problems? , 2005, Comput. Oper. Res..