Markov chain modelling of the solution surface in local search
暂无分享,去创建一个
[1] P. Stadler,et al. The landscape of the traveling salesman problem , 1992 .
[2] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..
[3] Andrew B. Kahng,et al. A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..
[4] C. R. Reeves,et al. Landscapes, operators and heuristic search , 1999, Ann. Oper. Res..
[5] Jennifer Ryan,et al. The Depth and Width of Local Minima in Discrete Solution Spaces , 1995, Discret. Appl. Math..
[6] Weinberger,et al. Local properties of Kauffman's N-k model: A tunably rugged energy landscape. , 1991, Physical review. A, Atomic, molecular, and optical physics.
[7] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[8] Vassilis Zissimopoulos,et al. On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient , 2000, Discret. Appl. Math..
[9] E. Anderson,et al. Mechanisms for local search , 1996 .
[10] E. Weinberger,et al. Correlated and uncorrelated fitness landscapes and how to tell the difference , 1990, Biological Cybernetics.
[11] Mihalis Yannakakis,et al. The Analysis of Local Search Problems and Their Heuristics , 1990, STACS.