An empirical study of hybrid genetic algorithms for the set covering problem
From MaRDI portal
Publication:3372520
DOI10.1057/palgrave.jors.2601919zbMath1081.90072OpenAlexW1964214534MaRDI QIDQ3372520
P. J. Knolle, Francis J. Vasko, D. S. Spiegel
Publication date: 21 February 2006
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601919
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Ambulance location routing problem considering all sources of uncertainty: progressive estimating algorithm ⋮ What is the best greedy-like heuristic for the weighted set covering problem?
Uses Software
This page was built for publication: An empirical study of hybrid genetic algorithms for the set covering problem
