Cybernetic Optimization by Simulated Annealing: An Implementation of Parallel Processing Using Probabilistic Feedback Control
暂无分享,去创建一个
[1] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[2] Fred W. Glover,et al. Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..
[3] M. Fleischer,et al. Assessing the performance of the simulated annealing algorithm using information theory , 1994 .
[4] Robert Azencott,et al. Simulated annealing : parallelization techniques , 1992 .
[5] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[6] D. Mitra,et al. Convergence and finite-time behavior of simulated annealing , 1986, Advances in Applied Probability.
[7] Norbert Wiener,et al. Cybernetics: Control and Communication in the Animal and the Machine. , 1949 .
[8] Ibrahim H. Osman,et al. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..
[9] Udi Manber,et al. Introduction to algorithms - a creative approach , 1989 .
[10] Emile H. L. Aarts,et al. Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.
[11] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[12] Richard W. Eglese,et al. Simulated annealing: A tool for operational research , 1990 .
[13] Mark A. Fleischer,et al. Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control , 1996, J. Heuristics.
[14] Norbert Wiener,et al. Cybernetics, or control and communication in the animal and the machine, 2nd ed. , 1961 .