The one constraint: general (non zero-one) integer progrmming problem is solvad by an algorithm "chat is a composition of a dynamic programming procedure and a branch and-bound algorithm: The procedura way be used for solving this type of problems (for example the renewal problem) or for calculating bounds in a beaach-aed-bound algorithre for several must probably the algorithm can be extended for other type of problems, for example for the several constraint linear integer programming problem, as it is suggested in paragraph 5.