Abstract:
We present an ant-based algorithm for finding good, near optimal solutions to the weighted minimum hitting set problem. We compare our results with the ones obtained by a...Show MoreMetadata
Abstract:
We present an ant-based algorithm for finding good, near optimal solutions to the weighted minimum hitting set problem. We compare our results with the ones obtained by a greedy procedure and by an ad hoc genetic algorithm.
Date of Conference: 26-26 April 2003
Date Added to IEEE Xplore: 05 June 2003
Print ISBN:0-7803-7914-4