1. M.A. Fleischer, Simulated annealing: past, present, and future, in: Proceedings of the 1995 Winter Simulation Conference, 1995, pp. 155–161
2. A.W. Johnson, Generalized hill climbing algorithms for discrete optimization problems, Ph.D. Dissertation, Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, Virginia, 1996
3. A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem;Sengupta;Naval Research Logistics Quarterly,1985
4. C.A. Tovey, On the number of iterations of local improvement algorithms, in: E. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997, pp. 57–90
5. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing;Dueck;Journal of Computational Physics,1990