Given a set N, a pairwise distance function d and an integer number m, the Dispersion Problems (DPs) require to extract from N a subset M of cardinality m, so as to optimize a suitable function of the distances between the elements in M. Different functions give rise to a whole family of...

Tabu search is a greatly successful metaheuristics, as illustrated through numerous publications showing its use for a range of difficult optimization problems. The tabu search literature is to a certain degree characterized by papers introducing new variations of the search, either presenting...

The primary objective of software testing is to locate bugs as many as possible in software by using an optimum set of test cases. Optimum set of test cases are obtained by selection procedure which can be viewed as an optimization problem. So metaheuristic optimizing (searching) techniques have...