The MALLBA project tackles the resolution of combinatorial
problems using algorithmic skeletons implemented in C++.
MALLBA offers three
families of generic resolution methods: exact, heuristic and
for each resolution method, MALLBA provides three different
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
computational results to show the viability of the approach.