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 shows the architecture of the MALLBA library, presents some of its skeletons and offers several computational results to show the viability of the approach.Postprint (published version
Combinatorial branch and bound searches are a common technique for solving global optimisation and d...
In this thesis, a new global optimization technique, its applications in particular to neural networ...
Tabu Search (TS) is a meta-heuristic for solving combinatorial optimization problems. A review of ex...
The MALLBA project tackles the resolution of combinatorial optimization problems using algorithmic s...
The mallba project tackles the resolution of combinatorial optimization problems using algorithmic s...
The mallba project tackles the resolution of combinatorial optimization problems using generic algor...
Abstract—Problems arising in different areas such as numerical methods, simulation or optimization c...
Problems arising in different areas such as numerical methods, simulation or optimization can be eff...
We present two generic parallel skeletons for the tabu search method-a well known meta-heuristic for...
In this paper we present two parallel skeletons for Tabu Search method -- a well known meta-heuristi...
In this paper we present two parallel skeltons for Tabu Search method --a well known meta-heuristic...
Abstract — The aim of this article is to propose the object-oriented design of the Bob++ framework. ...
Constraint satisfaction and combinatorial optimization problems, even when modeled with efficient m...
Combinatorial Optimization is becoming ever more crucial, in these days. From natural sciences to ec...
Algorithmic skeletons simplify software development: they abstract typical patterns of parallelism a...
Combinatorial branch and bound searches are a common technique for solving global optimisation and d...
In this thesis, a new global optimization technique, its applications in particular to neural networ...
Tabu Search (TS) is a meta-heuristic for solving combinatorial optimization problems. A review of ex...
The MALLBA project tackles the resolution of combinatorial optimization problems using algorithmic s...
The mallba project tackles the resolution of combinatorial optimization problems using algorithmic s...
The mallba project tackles the resolution of combinatorial optimization problems using generic algor...
Abstract—Problems arising in different areas such as numerical methods, simulation or optimization c...
Problems arising in different areas such as numerical methods, simulation or optimization can be eff...
We present two generic parallel skeletons for the tabu search method-a well known meta-heuristic for...
In this paper we present two parallel skeletons for Tabu Search method -- a well known meta-heuristi...
In this paper we present two parallel skeltons for Tabu Search method --a well known meta-heuristic...
Abstract — The aim of this article is to propose the object-oriented design of the Bob++ framework. ...
Constraint satisfaction and combinatorial optimization problems, even when modeled with efficient m...
Combinatorial Optimization is becoming ever more crucial, in these days. From natural sciences to ec...
Algorithmic skeletons simplify software development: they abstract typical patterns of parallelism a...
Combinatorial branch and bound searches are a common technique for solving global optimisation and d...
In this thesis, a new global optimization technique, its applications in particular to neural networ...
Tabu Search (TS) is a meta-heuristic for solving combinatorial optimization problems. A review of ex...