Reference65 articles.
1. H. C. Andersen and P. Diaconis. Hit and run as a unifying device. Journal de la societe francaise de statistique & revue de statistique appliquee, 148(4):5–28, 2007.
2. W. P. Baritompa, D. W. Bulger, and G. R. Wood. Grover’s quantum algorithm applied to global optimization. SIAM Journal of Optimization, 15(4):1170–1184, 2005.
3. W. P. Baritompa, D. W. Bulger, and G. R. Wood. Generating functions and the performance of backtracking adaptive search. Journal of Global Optimization 37:159–175, 2007.
4. S. Baumert, A. Ghate, S. Kiatsupaibul, Y. Shen, R. L. Smith, and Z. B. Zabinsky. Discrete hit-and-run for generating multivariate distributions over arbitrary finite subsets of a lattice. Operations Research, 57(3):727–739, 2009.
5. C. J. P. Bélisle. Convergence theorems for a class of simulated annealing algorithms on R
d
. J. Applied Probability, 29:885–895, 1992.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献