.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
quadratic assignment
branch-and-bound
heuristics
three-index assignment
OR in telecommunications
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method基于匈牙利方法的二次分配问题的分支定界算法
.png){kind=icon}
PREAI
分享收藏
查看更多内容