Hua Jiang
Hua Jiang
Assistant Professor, Yunnan University, China
Verified email at ynu.edu.cn
Title
Cited by
Cited by
Year
An exact algorithm for the maximum weight clique problem in large graphs
H Jiang, CM Li, F Manya
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
512017
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
CM Li, H Jiang, F Manyŗ
Computers & Operations Research 84, 1-15, 2017
422017
Incremental MaxSAT reasoning to reduce branches in a branch-and-bound algorithm for MaxClique
CM Li, H Jiang, RC Xu
International Conference on Learning and Intelligent Optimization, 268-274, 2015
192015
A two-stage maxsat reasoning approach for the maximum weight clique problem
H Jiang, CM Li, Y Liu, F Manya
Thirty-Second AAAI Conference on Artificial Intelligence, 2018
172018
Incremental upper bound for the maximum clique problem
CM Li, Z Fang, H Jiang, K Xu
INFORMS Journal on Computing 30 (1), 137-153, 2018
172018
A new upper bound for the maximum weight clique problem
CM Li, Y Liu, H Jiang, F Manyŗ, Y Li
European Journal of Operational Research 270 (1), 66-77, 2018
112018
Combining efficient preprocessing and incremental MaxSAT reasoning for MaxClique in large graphs
H Jiang, CM Li, F Manyŗ
Proceedings of the twenty-second European conference on artificial†…, 2016
112016
Solving longest common subsequence problems via a transformation to the maximum clique problem
C Blum, M Djukanovic, A Santini, H Jiang, CM Li, F Manyŗ, GR Raidl
Computers & Operations Research 125, 105089, 2021
52021
A learning based branch and bound for maximum common subgraph related problems
Y Liu, CM Li, H Jiang, K He
Proceedings of the AAAI Conference on Artificial Intelligence 34 (03), 2392-2399, 2020
32020
An effective variable neighborhood search with perturbation for location-routing problem
H Jiang, C Lucet, L Devendeville, CM Li
International Journal on Artificial Intelligence Tools 28 (07), 1950024, 2019
12019
A Learning based Branch and Bound for Maximum Common Subgraph Problems
Y Liu, C Li, H Jiang, K He
arXiv preprint arXiv:1905.05840, 2019
12019
A New Upper Bound Based on Vertex Partitioning for the Maximum k-plex Problem
H Jiang, D Zhu, Z Xie, S Yao, ZH Fu
The system can't perform the operation now. Try again later.
Articles 1–12