A heuristic applied to reduce the problem in some way before starting an algorithm. In linear programming, for example, one might scan for an equation of the form x=0, then simply fix x at zero, thus reducing the number of variables and constraints. Further details are in the supplement, Presolving A Linear Program.