Sciweavers

IPPS
1997
IEEE
14 years 3 months ago
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
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...
Smaïl Niar, Arnaud Fréville