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