A generalized search operator called PUSH is introduced for the Maximum Vertex Weight Clique Problem.
The usefulness of PUSH is demonstrated within two restart tabu search algorithms.
Competitive results are achieved by these algorithms on 142 benchmark instances.
PUSH can find other applications bypassing the studied problem and the search procedures.