.png){kind=icon}
Return
The quadratic three-dimensional assignment problem:: Exact and approximate solution methods
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.11.014.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper reports on algorithm development for solving the quadratic three-dimensional assignment problem (Q3AP). The Q3AP arises, for example, in the implementation of a hybrid ARQ (automatic repeat request) scheme for enriching diversity among multiple packet re-transmissions, by optimizing the mapping of data bits to modulation symbols. Typical practical problem sizes would be 8, 16, 32 and 64. We present an exact solution method based upon a reformulation linearization technique that is one of the best available for solving the quadratic assignment problem (QAP). Our current exact algorithm is useful for Q3AP instances of size 13 or smaller. We also investigate four stochastic local search algorithms that provide optimum or near optimum solutions for large and difficult QAP instances and adapt them for solving the Q3AP. The results of our experiments make it possible to get good solutions to signal mapping problems of size 8 and 16. (C) 2006 Elsevier B.V. All rights reserved.
Keywords:
quadratic assignment
branch-and-bound
heuristics
three-index assignment
OR in telecommunications
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
.png){kind=icon}
PREAI
ShareSaveShareSave
ShareSave
ShareSave
View more