PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem
详细信息 查看全文
- 作者：Yi Zhoua ; zhou@info.univ-angers.fr" class="auth_mail" title="E-mail the corresponding author ; Jin-Kao Hao ; a ; b ; hao@info.univ-angers.fr" class="auth_mail" title="E-mail the corresponding author ; Adrien Goë ; ffona ; goeffon@info.univ-angers.fr" class="auth_mail" title="E-mail the corresponding author
- 关键词：Local search ; Cliques ; Tabu search ; Heuristics
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：16 February 2017
- 年：2017
- 卷：257
- 期：1
- 页码：41-54
- 全文大小：628 K
文摘
- class="listitem" id="list_celist0002">
- class="label">•
A generalized search operator called PUSH is introduced for the Maximum Vertex Weight Clique Problem.
- class="label">•
The usefulness of PUSH is demonstrated within two restart tabu search algorithms.
- class="label">•
Competitive results are achieved by these algorithms on 142 benchmark instances.
- class="label">•
PUSH can find other applications bypassing the studied problem and the search procedures.