BHOSLIB: Benchmarks with Hidden Optimum Solutions for Graph Problems (Maximum Clique, Maximum Independent Set, Minimum Vertex Cover and Vertex Coloring)
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Cai, Shaowei; Su, Kaile; Luo, Chuan; Sattar, Abdul: NuMVC: an efficient local search algorithm for minimum vertex cover (2013)
- Wu, Qinghua; Hao, Jin-Kao; Glover, Fred: Multi-neighborhood tabu search for the maximum weight clique problem (2012)
- Cai, Shaowei; Su, Kaile; Sattar, Abdul: Local search with edge weighting and configuration checking heuristics for minimum vertex cover (2011)