Evolutionary algorithms and matroid optimization problems

DOI10.1007/S00453-008-9253-4zbMATH Open1187.90237OpenAlexW2082187727MaRDI QIDQ848644FDOQ848644

Authors: Joachim Reichel, Martin Skutella 

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

Recommendations

• Evolutionary computation in combinatorial optimization
• scientific article; zbMATH DE number 1962832
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem

zbMATH Keywords

matroid intersectionrandomized search heuristicsminimum weight basis

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• Title not available (Why is that?)
• The matroid intersection cover problem
• Towards a runtime comparison of natural and artificial evolution
• Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
• Title not available (Why is that?)
• Evolutionary computation in combinatorial optimization
• The design of (almost) disjunct matrices by evolutionary algorithms
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• Practical performance models of algorithms in evolutionary program induction and other domains
• Title not available (Why is that?)
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
• Stability and recovery for independence systems
• Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems
• Title not available (Why is that?)

This page was built for publication: Evolutionary algorithms and matroid optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848644)