The classical constraints to prevent subtours in routing problems (i.e., to make sure every route is connected to a depot), are of the following form, $$ \sum_{(i,j) \in \delta(S)} x_{ij} \leq |S| - 1 \quad \forall S \subset V_C, $$ where $\delta(S)$ denotes all arcs connected to nodes in $S$ (and $V_C$ is the set of customer nodes), and $x_{ij}$ is the binary variable indicating whether edge $(i,j)$ is traversed.
Of course, adding a constraint for all $S \subset V_C$ is not feasible, so one usually separates such constraints/inequalities in a dynamic fashion (i.e, solving LP - separating inequality - resolve LP - separating - .. etc).
However, for $|S| = 2$ or $|S| = 3$ (i.e., all subsets of size 2, 3) the number of constraints is not too large. My question is the following: Is it worth the effort to enumerate such constraints for small sizes of $|S|$ and simply add those to the formulation before we start the solving process?