What is the official name of a specific type of combination algorithm
You are probably looking for subsets of a set. If a set has $n$ elements, it has $2^n$ subsets when counting also the empty set (there is a clear correspondence to all bit strings of length $n$). So if in your case $n=26$, there are about 67 million subsets of variables to check which might be unfeasible.