📖
Solving the maximum vertex weight clique problem via binary quadratic programming
Yang Wang, Jin-Kao Hao, Fred Glover, Zhipeng Lü, Qinghua Wu

Solving the maximum vertex weight clique problem via binary quadratic programming

Science & Mathematics Published 2016 Verification Pending

Overview & Synopsis

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.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Solving the maximum vertex weight clique problem via binary quadratic programming
Author / Organization Yang Wang, Jin-Kao Hao, Fred Glover, Zhipeng Lü, Qinghua Wu
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2016
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-191770
Original Source Link Visit Source Page on hal.science »