In this work, we propose a new heuristic aimed at finding feasible solutions for bounded integer linear programming problems with a positive constraint matrix and right-hand side. The heuristic involves bound reduction and rounding using an auxiliary problem. Both the bound reduction and rounding steps rely on the optimal solution of the continuous relaxation. The efficiency of the proposed heuristic, in terms of execution time and solution accuracy, is demonstrated through numerical experiments.