A parallel algorithm of branches and boundaries is considered for the problems of integer linear optimization. The algorithm is implemented on the multiprocessor computer with total storage RM600 on Fortran 77 with using of the parallel programming system MPI. Efficiencies of the parallel and sequence algorithms are compared.