Evolutionary algorithms and matroid optimization problems
From MaRDI portal
(Redirected from Publication:848644)
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
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3544074 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1962832 (Why is no real title available?)
- scientific article; zbMATH DE number 960162 (Why is no real title available?)
- 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
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and applications.
- Crossover can provably be useful in evolutionary computation
- Designing hierarchical survivable networks
- Deterministic network coding by matrix completion
- Efficient theoretic and practical algorithms for linear matroid intersection problems
- Implementing minimum cycle basis algorithms
- Improved Bounds for Matroid Partition and Intersection Algorithms
- Introduction to evolutionary computing
- Logic versus Approximation
- Mathematical Foundations of Computer Science 2003
- Matroids and the greedy algorithm
- Minimum spanning trees made easier via multi-objective optimization
- Note on Independence Functions
- On the analysis of the \((1+1)\) evolutionary algorithm
- Optimal assignments in an ordered set: An application of matroid theory
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The analysis of evolutionary algorithms on sorting and shortest paths problems
- The one-dimensional Ising model: mutation versus recombination
Cited in
(14)- Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
- Evolutionary computation in combinatorial optimization
- Practical performance models of algorithms in evolutionary program induction and other domains
- scientific article; zbMATH DE number 2219772 (Why is no real title available?)
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
- scientific article; zbMATH DE number 1743819 (Why is no real title available?)
- Stability and recovery for independence systems
- The design of (almost) disjunct matrices by evolutionary algorithms
- Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems
- Towards a runtime comparison of natural and artificial evolution
- scientific article; zbMATH DE number 1754532 (Why is no real title available?)
- Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
- The matroid intersection cover problem
- scientific article; zbMATH DE number 1962832 (Why is no real title available?)
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)
