113 search results - page 3 / 23 » On solving a hard quadratic 3-dimensional assignment problem |
140
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
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...
161
click to vote
JPDC
1998
15 years 4 months ago
1998
Programlibraries are one tool to make the cooperation between specialists from various elds successful: the separation of application-speci c knowledge from applicationindependent...
133
click to vote
ASIAMS
2008
IEEE
15 years 11 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...
157
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
131
click to vote
EMO
2009
Springer
15 years 11 months ago
2009
Springer
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...