A Genetic Algorithm for the Set Covering Problem
From MaRDI portal
Recommendations
- An empirical study of hybrid genetic algorithms for the set covering problem
- A genetic algorithm for the set covering problem
- An improved genetic algorithm for the set covering problem
- scientific article; zbMATH DE number 1487885
- Genetic algorithms applied to computationally difficult set covering problems
Cited in
(17)- A genetic algorithm for the set covering problem
- A parallel genetic algorithm to solve the set-covering problem
- A distributed genetic algorithm for deterministic and stochastic labor scheduling problems
- A new approach for solving set covering problem using jumping particle swarm optimization method
- A simulated evolution-based solution of the cover problem
- An adaptive memetic algorithm for solving the set covering problem
- An empirical study of hybrid genetic algorithms for the set covering problem
- Opening a web site at which one can get a benchmark input data set to solve the set covering problem
- On reserve and double covering problems for the sets with non-Euclidean metrics
- Generalized particular covering problem with genetic algorithms
- Genetic algorithms applied to computationally difficult set covering problems
- scientific article; zbMATH DE number 1487885 (Why is no real title available?)
- An indirect genetic algorithm for set covering problems
- scientific article; zbMATH DE number 1910920 (Why is no real title available?)
- An improved genetic algorithm for the set covering problem
- On multiple coverings of fixed size containers with non-Euclidean metric by circles of two types
- Algorithm for solving the generalized set cover problem for a special class of problems
This page was built for publication: A Genetic Algorithm for the Set Covering Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717130)
