Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations

DOI10.1007/s11047-021-09841-7zbMath1530.68283arXiv1805.10902OpenAlexW3132970566MaRDI QIDQ6095506

Andreas Göbel, Francesco Quinzan, Tobias Friedrich, Markus Wagner

Publication date: 8 September 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.10902

zbMATH Keywords

matroidsevolutionary algorithmssubmodular functionsmutation operators

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ Runtime analysis for permutation-based evolutionary algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal monitoring network designs
• An 0. 828-approximation algorithm for the uncapacitated facility location problem
• On the analysis of the \((1+1)\) evolutionary algorithm
• Multiplicative drift analysis
• On the analysis of a dynamic evolutionary algorithm
• Combinatorial auctions with decreasing marginal utilities
• Maximizing Non-monotone Submodular Functions
• Efficient Informative Sensing using Multiple Robots
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Reducibility among Combinatorial Problems
• Non-monotone submodular maximization under matroid and knapsack constraints
• Some optimal inapproximability results
• STACS 2005
• Introduction to evolutionary computing

This page was built for publication: Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations