Genetic algorithms applied to computationally difficult set covering problems

DOI10.1057/PALGRAVE.JORS.2600380MaRDI QIDQ4363748zbMATH OpenOpenAlexFDO

Authors L. de Souza Lopes, Luiz Antonio Nogueira Lorena

Publication date 25 May 1998

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600380

zbMATH Keywords

genetic algorithmsset covering

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09) Combinatorial optimization (90C27)

Recommendations

• A Genetic Algorithm for the Set Covering Problem
• A genetic algorithm for the set covering problem
• An improved genetic algorithm for the set covering problem
• An empirical study of hybrid genetic algorithms for the set covering problem
• scientific article; zbMATH DE number 1487885

Cited in

(20)

• Fuzzy logic based algorithms for maximum covering location problems
• A genetic algorithm for the set covering problem
• Bidirectional evolutionary heuristic for the minimum vertex-cover problem
• A parallel genetic algorithm to solve the set-covering problem
• Multiagent visual area coverage using a new genetic algorithm selection scheme
• The set covering problem revisited: an empirical study of the value of dual information
• An empirical study of hybrid genetic algorithms for the set covering problem
• Generalized particular covering problem with genetic algorithms
• scientific article; zbMATH DE number 2079889 (Why is no real title available?)
• scientific article; zbMATH DE number 1487885 (Why is no real title available?)
• An indirect genetic algorithm for set covering problems
• A Genetic Algorithm for the Set Covering Problem
• scientific article; zbMATH DE number 1910920 (Why is no real title available?)
• An improved genetic algorithm for the set covering problem
• Computing minimal hitting sets with a genetic algorithm
• On the use of genetic algorithms to solve location problems
• Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
• A biased random-key genetic algorithm for the Steiner triple covering problem
• Genetic algorithms to solve the cover printing problem
• Surrogate constraint normalization for the set covering problem

This page was built for publication: Genetic algorithms applied to computationally difficult set covering problems

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