Yanli Liu

Orcid: 0000-0001-6734-2601

Affiliations:

Wuhan University of Science and Technology, Wuhan, China
Huazhong University of Science and Technology, Wuhan, China

According to our database¹, Yanli Liu authored at least 12 papers between 2016 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Enhancing cooperative evolution in spatial public goods game by particle swarm optimization based on exploration and q-learning.

[BibT_eX]

[DOI]

Appl. Math. Comput., May, 2024

An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems.

[BibT_eX]

[DOI]

CoRR, 2024

An efficient solution space exploring and descent method for packing equal spheres in a sphere.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2024

DiverTEAM: An Effective Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023

Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem.

[BibT_eX]

[DOI]

CoRR, 2022

A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2020

A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

A Learning based Branch and Bound for Maximum Common Subgraph Problems.

[BibT_eX]

[DOI]

CoRR, 2019

2018

A new upper bound for the maximum weight clique problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2016

Breaking Cycle Structure to Improve Lower Bound for Max-SAT.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Yanli Liu

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...