On cut-based inequalities for capacitated network design polyhedra