Optimization by simulated annealing
暂无分享,去创建一个
[1] S. Lin,et al. Heuristic Programming as an Aid to Network Design , 1975, Networks.
[2] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[3] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[4] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[5] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[6] Richard M. Karp,et al. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..
[7] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .
[8] S. Kirkpatrick,et al. Solvable Model of a Spin-Glass , 1975 .
[9] M. Correia,et al. Design automation in IBM , 1981 .
[10] A. P. Young,et al. Low-temperature behavior of the infinite-range Ising spin-glass: Exact statistical mechanics for small samples , 1982 .
[11] S. Kirkpatrick,et al. Infinite-ranged models of spin-glasses , 1978 .
[12] S. Kirkpatrick. Frustration and ground-state degeneracy in spin glasses , 1977 .
[13] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.