An indirect genetic algorithm for set covering problems
From MaRDI portal
Publication:4656729
DOI10.1057/palgrave.jors.2601317zbMath1139.90428OpenAlexW1750082253MaRDI QIDQ4656729
Publication date: 14 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/663/
Related Items
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, 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 binary cat swarm optimization algorithm for the non-unicost set covering problem, A hybrid heuristic for the 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, An indirect genetic algorithm for a nurse-scheduling problem, An estimation of distribution algorithm for nurse scheduling, A mixed integer linear program and tabu search approach for the complementary edge covering problem, A 3-flip neighborhood local search for the set covering problem, An electromagnetism metaheuristic for the unicost set covering problem, The set covering problem revisited: an empirical study of the value of dual information, A new approach for solving set covering problem using jumping particle swarm optimization method, An adaptive heuristic algorithm for VLSI test vectors selection
Uses Software
