Generating functions and the performance of backtracking adaptive search
From MaRDI portal
Publication:995932
DOI10.1007/s10898-006-9042-zzbMath1143.90029OpenAlexW1974210586MaRDI QIDQ995932
David W. Bulger, W. P. Baritompa, Graham R. Wood
Publication date: 10 September 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9042-z
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise ⋮ Markov modelling and parameterisation of genetic evolutionary test generations
Cites Work
- Approximation of the distribution of convergence times for stochastic global optimisation
- Backtracking adaptive search: distribution of number of iterations to convergence
- Pure adaptive search in global optimization
- Hesitant adaptive search for global optimisation
- Implementing pure adaptive search with Grover's quantum algorithm
- Hesitant adaptive search: The distribution of the number of iterations to convergence
- Implementing pure adaptive search for global optimization using Markov chain sampling
This page was built for publication: Generating functions and the performance of backtracking adaptive search