Solving the maximum vertex weight clique problem via binary quadratic programming
Yang Wang (),
Jin-Kao Hao (),
Fred Glover (),
Zhipeng Lü () and
Qinghua Wu ()
Additional contact information
Yang Wang: Northwestern Polytechnical University
Jin-Kao Hao: Université d’Angers
Fred Glover: OptTek Systems, Inc
Zhipeng Lü: Huazhong University of Science and Technology
Qinghua Wu: Huazhong University of Science and Technology
Journal of Combinatorial Optimization, 2016, vol. 32, issue 2, No 12, 549 pages
Abstract:
Abstract In recent years, the general binary quadratic programming (BQP) model has been widely applied to solve a number of combinatorial optimization problems. In this paper, we recast the maximum vertex weight clique problem (MVWCP) into this model which is then solved by a probabilistic tabu search algorithm designed for the BQP. Experimental results on 80 challenging DIMACS-W and 40 BHOSLIB-W benchmark instances demonstrate that this general approach is viable for solving the MVWCP problem.
Keywords: Maximum vertex weight clique; Binary quadratic programming; Probabilistic tabu search (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-9990-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:2:d:10.1007_s10878-016-9990-2
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-016-9990-2
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().