References in zbMATH (referenced in 14 articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Pinto, Bruno Q.; Ribeiro, Celso C.; Rosseti, Isabel; Plastino, Alexandre: A biased random-key genetic algorithm for the maximum quasi-clique problem (2018)
  2. San Segundo, Pablo; Artieda, Jorge; Strash, Darren: Efficiently enumerating all maximal cliques with bit-parallelism (2018)
  3. Züge, Alexandre Prusch; Carmo, Renato: On comparing algorithms for the maximum clique problem (2018)
  4. Cerrone, Carmine; Cerulli, Raffaele; Golden, Bruce: Carousel greedy: a generalized greedy algorithm with applications in optimization (2017)
  5. Bergner, Martin; Lübbecke, Marco E.; Witt, Jonas T.: A branch-price-and-cut algorithm for packing cuts in undirected graphs (2016)
  6. Liu, Tian: Fractional edge cover number of model RB (2016)
  7. Wang, Yang; Hao, Jin-Kao; Glover, Fred; Lü, Zhipeng; Wu, Qinghua: Solving the maximum vertex weight clique problem via binary quadratic programming (2016)
  8. Fang, Zhiwen; Li, Chu-Min; Qiao, Kan; Feng, Xu; Xu, Ke: Solving maximum weight clique using maximum satisfiability reasoning (2014)
  9. Cai, Shaowei; Su, Kaile; Luo, Chuan; Sattar, Abdul: NuMVC: an efficient local search algorithm for minimum vertex cover (2013)
  10. Andrade, Diogo V.; Resende, Mauricio G. C.; Werneck, Renato F.: Fast local search for the maximum independent set problem (2012)
  11. Dang, Duc-Cuong; Moukrim, Aziz: Subgraph extraction and metaheuristics for the maximum clique problem (2012)
  12. Wu, Qinghua; Hao, Jin-Kao; Glover, Fred: Multi-neighborhood tabu search for the maximum weight clique problem (2012)
  13. Cai, Shaowei; Su, Kaile; Sattar, Abdul: Local search with edge weighting and configuration checking heuristics for minimum vertex cover (2011)
  14. Jiang, Wei; Liu, Tian; Ren, Tienan; Xu, Ke: Two hardness results on feedback vertex sets (2011)