Phase Transition and Landscape Properties of the Number Partitioning Problem
暂无分享,去创建一个
[1] Christian Borgs,et al. Phase transition and finite‐size scaling for the integer partitioning problem , 2001, Random Struct. Algorithms.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Thierry Mora,et al. Clustering of solutions in the random satisfiability problem , 2005, Physical review letters.
[4] C. Reeves,et al. Properties of fitness functions and search landscapes , 2001 .
[5] Wim Hordijk,et al. Phase transition and landscape statistics of the number partitioning problem. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[6] Ryszard Klempous,et al. Recent Advances in Intelligent Engineering Systems , 2011, Studies in Computational Intelligence.
[7] S. Mertens. Phase Transition in the Number Partitioning Problem , 1998, cond-mat/9807077.
[8] Daniel L. Stein,et al. Lectures In The Sciences Of Complexity , 1989 .
[9] Christopher R. Stephens,et al. Landscapes and Effective Fitness , 2003 .
[10] Michael Affenzeller,et al. A Comprehensive Survey on Fitness Landscape Analysis , 2012, Recent Advances in Intelligent Engineering Systems.
[11] Toby Walsh,et al. Analysis of Heuristics for Number Partitioning , 1998, Comput. Intell..
[12] Alexander K. Hartmann and Martin Weigt,et al. Phase transitions in combinatorial optimization problems , 2013 .
[13] Stephan Mertens,et al. A physicist's approach to number partitioning , 2000, Theor. Comput. Sci..
[14] Jeremy Frank,et al. When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..