| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4958917 | Computers & Operations Research | 2017 | 39 Pages |
Abstract
The paper presents several mathematical programming formulations of the CCP and proposes matheuristic solution approaches. The computational study is performed on the clustered adaptations of the DIMACS and BHOSLIB benchmark instances for the Maximum Weight Clique Problem. The achieved results are encouraging.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Krishna Teja Malladi, Snezana Mitrovic-Minic, Abraham P. Punnen,