This hybrid method for the 0-1 knapsack problem combines implicit enumeration and dynamic programming schemes in order to solve a wider class of problems than those of these two approaches considered separately. Computational results prove the efficiency of this algorithm - denoted by ID - for the subset-sum problem and the 0-1 knapsack problem with an inequality/equality constraint.