In this work the performance of several local search and metaheuristic methods is compared to previously reported work using evolutionary algorithms. The results show that while m...
We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved...
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...