CONVERGENCE OF AN ANNEALING ALGORITHM

被引:414
作者
LUNDY, M [1 ]
MEES, A [1 ]
机构
[1] UNIV WESTERN AUSTRALIA,DEPT MATH,NEDLANDS,WA 6009,AUSTRALIA
关键词
D O I
10.1007/BF01582166
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:111 / 124
页数:14
相关论文
共 18 条
[1]  
[Anonymous], 1981, Non-negative Matrices and Markov Chains
[2]  
Berman A., 1994, Nonnegative matrices in the mathematical sciences
[3]  
CERNY V, 1984, UNPUB J OPTIMIZATION
[4]  
EDWARDS AWF, 1966, UNPUB MINIMAL EVOLUT
[5]  
Everitt B., 1977, Cluster analysis
[6]  
Gary M. R., 1979, Computers and Intractability
[7]   STOCHASTIC RELAXATION, GIBBS DISTRIBUTIONS, AND THE BAYESIAN RESTORATION OF IMAGES [J].
GEMAN, S ;
GEMAN, D .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1984, 6 (06) :721-741
[8]  
Heyman D.P., 1982, Stochastic Models in Operations Research, VI.
[9]  
JOHNSON DL, 1984, COMMUNICATION
[10]  
Kelly Frank, 1978, Reversibility and Stochastic Networks