In this paper, we present an algorithm for treating multi-criteria integer linear programming problems. The proposed algorithm generates all efficient solutions of the multi-criteria integer linear programming problem having bounded objective functions on its feasible domain. The multi-criteria integer linear programming problem is divided into bi-criterion problems, then the resulting bi-criterion problems will be solved separately. The solution of each bi-criterion problem is determined with a finite sequence of single objective function integer linear programming problems. An example is given.