A simulated evolution-based solution of the cover problem

DOI10.1134/S1064230709010092MaRDI QIDQ2391718zbMATH OpenOpenAlexFDO

Authors V. M. Kureichik, B. K. Lebedev, O. B. Lebedev

Publication date 5 August 2013

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1064230709010092

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Fixed-parameter evolutionary algorithms and the vertex cover problem
• On the approximation ability of evolutionary optimization with application to minimum set cover
• A simulated evolution-based solution of the placement problem
• A Genetic Algorithm for the Set Covering Problem
• scientific article; zbMATH DE number 1534499
• A genetic algorithm for the set covering problem
• An improved genetic algorithm for the set covering problem
• An indirect genetic algorithm for set covering problems

Cites work

• scientific article; zbMATH DE number 802995 (Why is no real title available?)
• Discrete mathematics with combinatorics
• Multialternative genetic algorithms for the search of a function extremum
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics

Cited in

(6)

• On Approximating an Implicit Cover Problem in Biology
• A simulated evolution-based solution of the placement problem
• scientific article; zbMATH DE number 759418 (Why is no real title available?)
• scientific article; zbMATH DE number 5520539 (Why is no real title available?)
• On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms
• Bin covering with delivery and solving it with evolution of algorithms

This page was built for publication: A simulated evolution-based solution of the cover problem

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