论文

  1. Wang Y, Li C, Sun H, Chen J, Yin M. MLQCC: an improved local search algorithm for the set k‐covering problem[J]. International Transactions in Operational Research, 2019. pdf code

  2. J Gao, J Chen, M Yin, R Chen, Y Wang. An Exact Algorithm for Maximum k-Plexes in Massive Graphs, IJCAI 2018, 1449-1455 pdf

  3. Y Wang, S Cai, J Chen, M Yin. A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs, IJCAI 2018, 1514-1522 pdf

  4. Y Wang, S Cai, J Chen, M Yin. A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs, IJCAI 2018, 1514-1522 pdf

  5. Lin Y , Weitong C , Xue L , et al. A survey of sentiment analysis in social media[J]. Knowledge and Information Systems, 2018. pdf

  6. Wang Y, Cai S, Yin M. New heuristic approaches for maximum balanced biclique problem[J]. Information Sciences, 2018, 432: 362-375. pdf

  7. Wang Y, Ouyang D, Yin M, et al. A restart local search algorithm for solving maximum set k-covering problem[J]. Neural Computing and Applications, 2018, 29(10): 755-765. pdf

  8. Yong Lai, Dayou Liu, Minghao Yin, New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition, IJCAI 2017 (Journal Track) pdf

  9. Li R, Hu S, Gao J, et al. GRASP for connected dominating set problems[J]. Neural Computing and Applications, 2017, 28(1): 1059-1067. pdf

  10. Zhang H, Cai S, Luo C, et al. An efficient local search algorithm for the winner determination problem[J]. Journal of Heuristics, 2017, 23(5): 367-396. pdf

  11. Zhou J, Liang J, Yin M. Comments on Evaluating the Claims of SAT Requires Exhaustive Search. [PDF]