Evolutionary algorithms and matroid optimization problems
type: Item
instance of: scholarly article
title: Evolutionary algorithms and matroid optimization problems
zbMATH Open document ID: 1187.90237
author: Joachim Reichel
author: Martin Skutella
published in: Algorithmica
publication date: 2010-03-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5677434
zbMATH Keywords: minimum weight basis
zbMATH Keywords: matroid intersection
zbMATH Keywords: randomized search heuristics
MaRDI profile type: Publication
full work available at URL: s00453-008-9253-4
OpenAlex ID: W2082187727
cites work: Q5687948
cites work: Designing hierarchical survivable networks
cites work: Improved Bounds for Matroid Partition and Intersection Algorithms
cites work: Crossover can provably be useful in evolutionary computation
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: Matroids and the greedy algorithm
cites work: Introduction to evolutionary computing
cites work: The one-dimensional Ising model: mutation versus recombination
cites work: Efficient theoretic and practical algorithms for linear matroid intersection problems
cites work: Optimal assignments in an ordered set: An application of matroid theory
cites work: Q4198056
cites work: Q4418669
cites work: Deterministic network coding by matrix completion
cites work: An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: Q4119222
cites work: An Analysis of the Greedy Heuristic for Independence Systems
cites work: Combinatorial optimization. Theory and applications.
cites work: Q3507772
cites work: Minimum spanning trees made easier via multi-objective optimization
cites work: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
cites work: Q3135082
cites work: Note on Independence Functions
cites work: The analysis of evolutionary algorithms on sorting and shortest paths problems
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Mathematical Foundations of Computer Science 2003
cites work: Logic versus Approximation
DOI: 10.1007/S00453-008-9253-4
description: scientific article; zbMATH DE number 5677434