266 search results - page 5 / 54 » A greedy genetic algorithm for the quadratic assignment prob... |
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...
GECCO
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
NETWORKS
2010
13 years 2 months ago
2010
SODA
2000
ACM
13 years 8 months ago
2000
ACM
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...