103 search results - page 3 / 21 » A new heuristic for the quadratic assignment problem |
SOCC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
COR
2010
13 years 7 months ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
EVOW
2004
Springer
14 years 25 days ago
2004
Springer
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 ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
ASIAMS
2008
IEEE
14 years 1 months ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...