NSGAII With Local Search Based Heavy Perturbation for Bi-Objective Weighted Clique Problem
This paper focuses on the clique problem of a weighted graph where weights of vertices can be either positive or negative (WG-PN). Two objectives, the size and the total weight of a clique, are considered. In particular, the larger size in terms of set inclusion and the higher total weight a clique...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2018-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8463462/ |