We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...