In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph <i>G=(V,E)</i>, non-negative vertex weights <i>wt<inf>v</inf></i> for all vertices <i>v ∈ V</i>, and node-capacities <i>B<inf>v</inf> ≥ 1</i> for all <i>v ∈ V</i>. A feasible solution to a given… (More)