Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems. - Jian Gao 007; Minghao Yin; Junping Zhou (AAAI, 2011)

Phase Transitions in Knowledge Compilation: An Experimental Study. - Jian Gao 007; Minghao Yin; Ke Xu 001 (SAT, 2011)

A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. - Jian Gao 007; Rong Chen 003 (Int. J. Comput. Intell. Syst., 2011)

A novel parallel hybrid intelligence optimization algorithm for a function approximation problem. - Wu Deng; Rong Chen 003; Jian Gao 007; Yingjie Song; Junjie Xu (Comput. Math. Appl., 2012)

Isolating and Understanding Program Errors Using Probabilistic Dispute Model. - Rong Chen 003; Yaqing Liu; Zhichun Jia; Jian Gao 007 (COMPSAC, 2013)

A hybrid strategy for community detection of complex networks. - Hui Li 014; Li-Ying Hao; Xin Ge; Jian Gao 007 (ICIA, 2015)

Experimental analyses on phase transitions in compiling satisfiability problems. - Jian Gao 007; Jianan Wang; Minghao Yin (Sci. China Inf. Sci., 2015)

Hidden State Conditional Random Field for Abnormal Activity Recognition in Smart Homes. - Yu Tong; Rong Chen 003; Jian Gao 007 (Entropy, 2015)

An Information Entropy-Based Animal Migration Optimization Algorithm for Data Clustering. - Lei Hou 018; Jian Gao 007; Rong Chen 003 (Entropy, 2016)

The Broken-Triangle Property with Adjoint Values. - Jian Gao 007; Rong Chen 003; Minghao Yin; Hui Li 014 (FAW, 2017)

A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem. - Shifeng Chen; Rong Chen 003; Jian Gao 007 (Algorithms, 2017)

A randomized diversification strategy for solving satisfiability problem with long clauses. - Jian Gao 007; Ruizhi Li; Minghao Yin (Sci. China Inf. Sci., 2017)

Diversified Top-k Partial MaxSAT Solving. - Junping Zhou; Huanyao Sun; Feifei Ma; Jian Gao 007; Ke Xu 001; Minghao Yin (CoRR, 2017)

GRASP for connected dominating set problems. - Ruizhi Li; Shuli Hu; Jian Gao 007; Yupeng Zhou; Yiyuan Wang 002; Minghao Yin (Neural Comput. Appl., 2017)

A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows. - Shifeng Chen; Rong Chen 003; Jian Gao 007 (Sci. Program., 2017)

NuMWVC: A Novel Local Search for Minimum Weighted Vertex Cover Problem. - Ruizhi Li; Shaowei Cai 001; Shuli Hu; Minghao Yin; Jian Gao 007 (AAAI, 2018)

An Exact Algorithm for Maximum k-Plexes in Massive Graphs. - Jian Gao 007; Jiejiang Chen; Minghao Yin; Rong Chen 003; Yiyuan Wang 002 (IJCAI, 2018)

Enhancing Bug Report Assignment with an Optimized Reduction of Training Set. - Miaomiao Wei; Shikai Guo; Rong Chen 003; Jian Gao 007 (KSEM (2), 2018)

An adaptive large neighborhood search heuristic for dynamic vehicle routing problems. - Shifeng Chen; Rong Chen 003; Gai-Ge Wang; Jian Gao 007; Arun Kumar Sangaiah (Comput. Electr. Eng., 2018)

Crowdsourced Web Application Testing Under Real-Time Constraints. - Shikai Guo; Rong Chen 003; Hui Li 014; Jian Gao 007; Yaqing Liu (Int. J. Softw. Eng. Knowl. Eng., 2018)

An efficient local search for partial vertex cover problem. - Yupeng Zhou; Yiyuan Wang 002; Jian Gao 007; Na Luo; Jianan Wang (Neural Comput. Appl., 2018)

A Multi-objective Optimization Algorithm Based on Monarch Butterfly Optimization. - Rui Hu; Jian Gao 007; Rong Chen 003; Jiahao Jiang (ICNC-FSKD, 2019)

Vertex Selection Heuristics in Branch-and-Bound Algorithms for the Maximum k-Plex Problem. - Kuixian Wu; Jian Gao 007; Rong Chen 003; Xianji Cui (Int. J. Artif. Intell. Tools, 2019)

Early and Efficient Identification of Useless Constraint Propagation for Alldifferent Constraints. - Xizhe Zhang; Jian Gao 007; Yizhi Lv; Weixiong Zhang (IJCAI, 2020)

Solving quantified constraint satisfaction problems with value selection rules. - Jian Gao 007; Jinyan Wang; Kuixian Wu; Rong Chen 003 (Frontiers Comput. Sci., 2020)

NuMWVC: A novel local search for minimum weighted vertex cover problem. - Ruizhi Li; Shuli Hu; Shaowei Cai 001; Jian Gao 007; Yiyuan Wang 002; Minghao Yin (J. Oper. Res. Soc., 2020)

MOOP4PD : A Multi-objective Optimization Approach for Package Delivery by the Crowd of Occupied Taxis. - Zhifeng Zhou; Rong Chen 003; Jian Gao 007 (SmartWorld/SCALCOM/UIC/ATC/IOP/SCI, 2021)

An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs. - Jian Gao 007; Zhenghang Xu; Ruizhi Li; Minghao Yin (AAAI, 2022)

Improving Simulated Annealing for Clique Partitioning Problems. - Jian Gao 007; Yiqi Lv; Minghao Liu 001; Shaowei Cai 001; Feifei Ma (J. Artif. Intell. Res., 2022)

A multi-objective optimization approach to package delivery by the crowd of occupied taxis. - Zhifeng Zhou; Rong Chen 003; Jian Gao 007; Hu Xing (Knowl. Inf. Syst., 2022)

A restart local search algorithm with relaxed configuration checking strategy for the minimum k-dominating set problem. - Ruizhi Li; Siqi Liu; Fangzhou Wang; Jian Gao 007; Huan Liu; Shuli Hu; Minghao Yin (Knowl. Based Syst., 2022)

Towards more efficient local search algorithms for constrained clustering. - Jian Gao 007; Xiaoxia Tao; Shaowei Cai 001 (Inf. Sci., 2023)

Learning driven three-phase search for the maximum independent union of cliques problem. - Zhi Lu; Jian Gao 007; Jin-Kao Hao; Pingle Yang; Lixin Zhou (Comput. Oper. Res., 2024)

Heuristic Search with Cut Point Based Strategy for Critical Node Problem. - Zhihan Chen; Shaowei Cai 001; Jian Gao 007; Shike Ge; Chanjuan Liu; Jinkun Lin (J. Comput. Sci. Technol., 2024)