Sciweavers

EVOW
2004
Springer
13 years 9 months ago
New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
Thomas Stützle, Susana Fernandes