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
In theoretical computer science, combinatorial optimization problems are about finding an optimal it...
This paper reports about research projects of the University of Paderborn in the field of distribute...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
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. ...
AbstractThis is a tutorial introduction to the literature on parallel computers and algorithms that ...
We present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-...
This paper addresses the development of general purpose meta-heuristic based combinatorial optimisat...
This paper addresses the development of general purpose meta-heuristic based combinatorial optimisat...
In theoretical computer science, combinatorial optimization problems are about finding an optimal it...
This paper reports about research projects of the University of Paderborn in the field of distribute...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
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. ...
AbstractThis is a tutorial introduction to the literature on parallel computers and algorithms that ...
We present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-...
This paper addresses the development of general purpose meta-heuristic based combinatorial optimisat...
This paper addresses the development of general purpose meta-heuristic based combinatorial optimisat...
In theoretical computer science, combinatorial optimization problems are about finding an optimal it...
This paper reports about research projects of the University of Paderborn in the field of distribute...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc