Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
This paper proposes a new Evolutionary Algorithm for the Dynamic Resource Constrained Project Scheduling Problem. This algorithm has new features that get around some problems lik...
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...