Utilizing Heuristics and Metaheuristics for Solving the Set Covering Problem
A basic combinatorial optimization problem, the Set Covering Problem (SCP) finds extensive use in computer science, operations research, and logistics, among other domains. The SCP’s goal is to determine the smallest number of subsets, or sets, needed to cover every element precisely once given a f...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidade do Porto
2024-07-01
|
| Series: | U.Porto Journal of Engineering |
| Subjects: | |
| Online Access: | https://journalengineering.fe.up.pt/index.php/upjeng/article/view/2474 |