113 search results - page 1 / 23 » On solving a hard quadratic 3-dimensional assignment problem |
SODA
2010
ACM
14 years 8 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...
IPPS
2009
IEEE
14 years 5 months ago
2009
IEEE
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...
IPCO
1996
14 years 5 days ago
1996
This paper investigates a restricted version of the Quadratic Assignment Problem (QAP), where one of the coefficient matrices is an Anti-Monge matrix with non-decreasing rows and ...
JUCS
2007
13 years 10 months ago
2007
: Recently, Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. A quick review of the literature reveals that re...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...