Minghao Yin

Latest

• Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism. Artif. Intell. 314: 103819 (2023)
• Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization
• NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem
• NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem AAAI 2021: 12258-12266
• NuMWVC: A novel local search for minimum weighted vertex cover problem Oper. Res. Soc. 71(9): 1498-1509 (2020)
• Reduction and Local Search for Weighted Graph Coloring Problem
• SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem. Artif. Intell. 280: 103230 (2020)
• A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs. IJCAI 2018: 1514-1522
• New heuristic approaches for maximum balanced biclique problem 432: 362-375 (2018)
• NuMWVC: A Novel Local Search for Minimum Weighted Vertex Cover Problem
• An efficient local search algorithm for the winner determination problem J. Heuristics 23(5): 367-396 (2017)
• Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function.
• Two Efficient Local Search Algorithms for Maximum Weight Clique Problem