This e-book is devoted to global optimization algorithms, which are methods to find optimal
solutions for given problems. It especially focuses on Evolutionary Computation by …

The term 'Memetic Algorithms'[74](MAs) was introduced in the late 80s to denote a family of
metaheuristics that have as central theme the hybridization of different algorithmic …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

In this paper we propose three metaheuristic approaches, namely a Tabu Search, an
Evolutionary Computation and an Ant Colony Optimization approach, for the edge-weighted …

The mallba project tackles the resolution of combinatorial optimization problems using
generic algorithmic skeletons implemented in C++. A skeleton in the mallba library …

In this paper, we consider combinatorial optimization problems with additional cardinality
constraints. In k-cardinality combinatorial optimization problems, a cardinality constraint …

In this chapter we present a hybrid evolutionary metaheuristic based on memetic algorithms
(MAs) and several local search algorithms. The memetic algorithm is used as the principal …

The minimum k-cardinality tree problem on graph G consists in finding a subtree of G with
exactly k edges whose sum of weights is minimum. A number of heuristic methods have …

In this paper we revisit an existing dynamic programming algorithm for finding optimal
subtrees in edge weighted trees. This algorithm was sketched by Maffioli in a technical …

In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality
tree problem in edge-weighted graphs. This problem has several applications in practice …