In this paper we present several algorithms which combine a partial   enumeration with meta-heuristics for the solution of general   mixed-integer programming problems.  The enumeration is based on the   primal values assignable to the integer variables of the problem. We   develop some algorithms for this integration, and test them using a   set of well-known benchmark problems.