- Tsitsiklis, J.N., 1989. Markov chains with rare transitions and simulated annealing. Mathematics of Operations Research, 14(1), pp.70-90. [ www ] ( SA )
- Hajek, B., 1988. Cooling schedules for optimal annealing. Mathematics of Operations Research, 13(2), pp.311-329. [ www ] ( SA )
- Chiang, T.S. and Chow, Y., 1988. On eigenvalues and annealing rates. Mathematics of Operations Research, 13(3), pp.508-511. [ www ] ( SA )
- Solis, F.J. and Wets, R.J.B., 1981. Minimization by random search techniques. Mathematics of Operations Research, 6(1), pp.19-30. [www] ] ( RS )
- Wardi, Y., 1989. Random search algorithms with sufficient descent for minimization of functions. Mathematics of operations research, 14(2), pp.343-354. [ www ] (RS)
- Ohlmann, J.W., Bean, J.C. and Henderson, S.G., 2004. Convergence in probability of compressed annealing. Mathematics of Operations Research, 29(4), pp.837-860. [ www ]
- Hannig, J., Chong, E.K. and Kulkarni, S.R., 2006. Relative frequencies of generalized simulated annealing. Mathematics of Operations Research, 31(1), pp.199-216. [ www ]
- De Klerk, E. and Laurent, M., 2018. Comparison of Lasserre’s measure-based bounds for polynomial optimization to bounds obtained by simulated annealing. Mathematics of Operations Research, 43(4), pp.1317-1325. [ www ]