Evolutionary algorithms and matroid optimization problems

DOI10.1007/s00453-008-9253-4zbMath1187.90237OpenAlexW2082187727MaRDI QIDQ848644

Martin Skutella, Joachim Reichel

Publication date: 4 March 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9253-4

zbMATH Keywords

matroid intersectionrandomized search heuristicsminimum weight basis

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Towards a runtime comparison of natural and artificial evolution, The matroid intersection cover problem, Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems, Practical performance models of algorithms in evolutionary program induction and other domains, Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint, Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms, Stability and Recovery for Independence Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Crossover can provably be useful in evolutionary computation
• Minimum spanning trees made easier via multi-objective optimization
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• On the analysis of the \((1+1)\) evolutionary algorithm
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• Efficient theoretic and practical algorithms for linear matroid intersection problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial optimization. Theory and applications.
• The one-dimensional Ising model: mutation versus recombination
• Designing Hierarchical Survivable Networks
• Note on Independence Functions
• Improved Bounds for Matroid Partition and Intersection Algorithms
• An Analysis of the Greedy Heuristic for Independence Systems
• An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
• Mathematical Foundations of Computer Science 2003
• Optimal assignments in an ordered set: An application of matroid theory
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Matroids and the greedy algorithm
• Logic versus Approximation
• Introduction to evolutionary computing