An indirect genetic algorithm for set covering problems
From MaRDI portal
Recommendations
- A Genetic Algorithm for the Set Covering Problem
- An improved genetic algorithm for the set covering problem
- Genetic algorithms applied to computationally difficult set covering problems
- An empirical study of hybrid genetic algorithms for the set covering problem
- A genetic algorithm for the set covering problem
Cited in
(18)- An adaptive heuristic algorithm for VLSI test vectors selection
- An indirect genetic algorithm for a nurse-scheduling problem
- A binary cat swarm optimization algorithm for the non-unicost set covering problem
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Genetic algorithm of tournament crowding based on Gaussian mutation
- A new approach for solving set covering problem using jumping particle swarm optimization method
- A simulated evolution-based solution of the cover problem
- An estimation of distribution algorithm for nurse scheduling
- A 3-flip neighborhood local search for the set covering problem
- The set covering problem revisited: an empirical study of the value of dual information
- Optimization strategy of credit line management for credit card business
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
- A hybrid heuristic for the set covering problem
- Harnessing memetic algorithms: a practical guide
- An effective and simple heuristic for the set covering problem
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
This page was built for publication: An indirect genetic algorithm for set covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4656729)
