The boolean quadratic programming problem with generalized upper bound constraints
详细信息 查看全文
- 作者：Yang Wanga ; sparkle.wy@gmail.com" class="auth_mail" title="E-mail the corresponding author ; Abraham P. Punnenb ; apunnen@sfu.ca" class="auth_mail" title="E-mail the corresponding author
- 关键词：Discrete optimization ; Boolean quadratic programs ; Quadratic assignment ; Quadratic semi-assignment ; Generalized upper bounds ; Metaheuristics
- 刊名：Computers and Operations Research
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：77
- 期：Complete
- 页码：1-10
- 全文大小：574 K
文摘
- •
We consider the boolean quadratic programming problem with generalized upper bound constraints (BQP-GUB).
- •
We present various complexity results on the problem along with different metaheuristic algorithms.
- •
Results of extensive experimental analysis are presented demonstrating the efficacy of our proposed algorithms.