Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

Covering location models assume that a demand point is either fully covered or not covered at all. Gradual cover models consider the possibility of partial cover. In this paper, we investigate the ...