Author:
Gutjahr Walter J.,Montemanni Roberto
Publisher
Springer International Publishing
Reference114 articles.
1. D. Achlioptas, A. Naor, Y. Peres, Rigorous location of phase transitions in hard optimization problems. Nature 435, 759–764 (2005)
2. Y. Akimoto, S. Astete-Morales, O. Teytaud, Analysis of runtime of optimization algorithms for noisy functions over discrete codomains. Theor. Comput. Sci. 605, 42–50 (2015)
3. M.H. Alrefaei, S. Andradottir, A simulated annealing algorithm with constant temperature for discrete stochastic optimization. Manag. Sci. 45, 748–764 (1999)
4. K. Alyahya, J.E. Rowe, Phase transition and landscape properties of the number partitioning problem, in European Conference on Evolutionary Computation in Combinatorial Optimization (Springer, Berlin, 2014), pp. 206–217
5. A. Auger, B. Doerr (eds.), Theory of Randomized Search Heuristics: Foundations and Recent Developments, vol. 1 (World Scientific, Singapore, 2011)