activity
20142024
most citedNuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover

127 citations · 166 across the 5 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

cs.AI2020

Improving the Performance of Stochastic Local Search for Maximum Vertex Weight Clique Problem Using Programming by Optimization

Yi Chu, Chuan Luo, Holger H. Hoos +2

The maximum vertex weight clique problem (MVWCP) is an important generalization of the maximum clique problem (MCP) that has a wide range of real-world applications. In situations…