Abstract The integer programming literature contains many algorithms for solving all‐integer programming problems but, in general, existing algorithms are less than satisfactory even in solving problems of modest size. In this paper we present a new technique for solving the all‐integer, integer programming problem. This algorithm is a hybrid (i.e., primal‐dual) cutting‐plane method which alternates between a primal‐feasible stage related to Young's simplified primal algorithm, and a dual‐infeasible stage related to Gomory's dual all‐integer algorithm. We present the results of computational testing.