1. Abernethy , J. Hazan , E. Rakhlin , A. 2008 Competing in the dark: An efficient algorithm for bandit linear optimization, in ‘Proceedings of the 21st Annual Conference on Learning Theory’, 263 274
2. Optimal learning by experimentation;Aghion;The Review of Economic Studies,1991
3. Sample mean based index policies with O (log n) regret for the multi-armed bandit problem;Agrawal;Advances in Applied Probability,1995
4. A simulated annealing algorithm with constant temperature for discrete stochastic optimization;Alrefaei;Management Science,1999
5. Adaptive random search for continuous simulation optimization;Andradóttir;Naval Research Logistics,2010