Search

Few direct matches — filled in with the latest updates.

Tag: #metaheuristic1 results

Universe Segmentation Boosts Set Cover Optimization

Universe Segmentation Boosts Set Cover Optimization

Researchers introduce universe segmentability for decomposing Minimum Set Cover Problem (MSCP) instances into independent subproblems using union-find preprocessing. Subproblems are solved via GRASP metaheuristic with bit-level set representations for efficiency. Experiments demonstrate superior solution quality and scalability on benchmarks.