Optimization by Simulated Annealing
暂无分享,去创建一个
C. D. Gelatt | S Kirkpatrick | C D Gelatt | M P Vecchi | S. Kirkpatrick | M. Vecchi | Mario P. Vecchi
[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[2] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[3] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[5] S. Kirkpatrick,et al. Solvable Model of a Spin-Glass , 1975 .
[6] Richard M. Karp,et al. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] S. Kirkpatrick,et al. Infinite-ranged models of spin-glasses , 1978 .
[9] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .
[10] C. Castellani,et al. Disordered Systems and Localization , 1982 .
[11] William M. van Cleemput,et al. Design Automation for Digital Systems , 1984, Computer.