This article present skeletons to solve Optimization Problems using the Branch-and-Bound technique. The skeletons user is provided with the possibility to solve its problems, as much of sequential form as of parallel and distributed forms without having to modify its code. The skeleton has been implemented using three different programming languages: C, C++ and Java. The .rst part of our proposal compare the different languages implementations. The second part of our proposal consists of a comparison between the parallel and distributed tools to implement the parallel and distributed versions. An algorithm for the resolution of the classic 0-1 Knapsack Problem has been implemented using the three implementations of skeletons proposed. The parallel implementations have been made using MPI and Java Sockets. Some computational results of the comparison of the languages are presented.