The mallba project tackles the resolution of combinatorial optimization problems using algorithmic skeletons implemented in C++. mallba offers three families of generic resolution methods: exact, heuristic and hybrid. Moreover, for each resolution method, mallba provides three different implementations: sequential, parallel for local area networks, and parallel for wide area networks (currently under development). This paper explains the architecture of the mallba library, presents some of its skeletons, and offers several computational results to show the viability of the approach.