SetCoverPy: A heuristic solver for the set cover problem
Abstract
SetCoverPy finds an (near-)optimal solution to the set cover problem (SCP) as fast as possible. It employs an iterative heuristic approximation method, combining the greedy and Lagrangian relaxation algorithms. It also includes a few useful tools for a quick chi-squared fitting given two vectors with measurement errors.
- Publication:
-
Astrophysics Source Code Library
- Pub Date:
- March 2022
- Bibcode:
- 2022ascl.soft03025Z
- Keywords:
-
- Software