A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the result...
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
Qiming Hou, Xin Sun, Kun Zhou, Christian Lauterbac...
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...