The MALLBA project tackles the resolution of combinatorial optimisation 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 shows the architecture of the MALLBA library, presents some of its skeletons
and offers some computational results to show the viability of the approach.