Randomized search heuristics as an alternative to exact optimization
From MaRDI portal
Recommendations
Cited in
(18)- Randomized algorithms in combinatorial optimization: A survey
- Importance of search-domain reduction in random optimization
- Alternative sampling strategy for a random optimization algorithm
- Upper and lower bounds for randomized search heuristics in black-box optimization
- Search heuristics and the influence of non-perfect randomness: examining genetic algorithms and simulated annealing
- Enhancing stochastic search performance by value-biased randomization of heuristics
- Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm
- Analyzing randomized search heuristics: tools from probability theory
- Oblivious Randomized Direct Search for Real-Parameter Optimization
- scientific article; zbMATH DE number 4125200 (Why is no real title available?)
- scientific article; zbMATH DE number 1203377 (Why is no real title available?)
- Theory of evolutionary algorithms and genetic programming
- On the size of weights in randomized search heuristics
- Evaluating the importance of randomization in adaptive large neighborhood search
- scientific article; zbMATH DE number 6276119 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2003
- Worst-case and average-case approximations by simple randomized search heuristics
- Evolutionary algorithms and matroid optimization problems
This page was built for publication: Randomized search heuristics as an alternative to exact optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712366)