Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization
- 22 August 2018
- book chapter
- Published by Springer Nature
- p. 134-145
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Mutation Rate Matters Even When Optimizing Monotonic FunctionsEvolutionary Computation, 2013
- Maximizing Non-monotone Submodular FunctionsSIAM Journal on Computing, 2011
- Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective ModelsEvolutionary Computation, 2010
- Combinatorial auctions with decreasing marginal utilitiesGames and Economic Behavior, 2006
- Real royal road functions—where crossover provably is essentialDiscrete Applied Mathematics, 2005
- On the analysis of the (1+1) evolutionary algorithmTheoretical Computer Science, 2002
- Some optimal inapproximability resultsJournal of the ACM, 2001
- Parameter control in evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 1999
- An 0.828-approximation algorithm for the uncapacitated facility location problemDiscrete Applied Mathematics, 1999
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995