This paper presents a Multistart Iterated Tabu Search (MITS) algorithm for solving Bandwidth Coloring Problem (BCP) and Bandwidth MultiColoring problem (BMCP).Expand

An equitable legal k-coloring of an undirected graph G = (V, E) is a partition of the vertex set V into k disjoint independent sets such that the cardinalities of any two independent sets differ by at most one (this is called the equity constraint).Expand

We present a tabu search based memetic algorithm for MaxMeanDP which relies on solution recombination and local optimization to find high quality solutions.Expand

In this paper, a global optimization method is presented to determine the global-minimum structures of atomic clusters, where several already existing techniques are combined, such as the dynamic… Expand

Abstract The structures of silver clusters from Ag 141 to Ag 310 are systematically optimized with a modified version of the dynamic lattice searching method with constructed core (DLSc). The… Expand