We stand with Ukraine

We stand with Ukraine

Yan Jin

Orcid: 0000-0002-6748-5634

Affiliations:

Huazhong University of Science & Technology, Wuhan, China
University of Angers, France (PhD 2015)

According to our database¹, Yan Jin authored at least 34 papers between 2012 and 2025.

Collaborative distances:

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

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org
on ieeexplore.ieee.org

On csauthors.net:

Bibliography

2025

Integrating multi-armed bandit with local search for MaxSAT.

[BibT_eX]

[DOI]

,

,

,

,

,

Artif. Intell., 2025

2023

Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems.

[BibT_eX]

[DOI]

,

,

,

,

Knowl. Based Syst., 2023

H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem.

[BibT_eX]

[DOI]

,

,

,

,

,

,

CoRR, 2023

Relaxed Graph Color Bound for the Maximum k-plex Problem.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2023

H-TSP: Hierarchically Solving the Large-Scale Traveling Salesman Problem.

[BibT_eX]

[DOI]

,

,

,

,

,

,

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

Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

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

2022

Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization.

[BibT_eX]

[DOI]

,

,

,

,

,

IEEE Trans. Computers, 2022

On fast enumeration of maximal cliques in large graphs.

[BibT_eX]

[DOI]

,

,

,

,

Expert Syst. Appl., 2022

An effective branch-and-bound algorithm for the maximum s-bundle problem.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Oper. Res., 2022

Multi-Agent Reinforcement Learning with Shared Resources for Inventory Management.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

,

,

CoRR, 2022

Incorporating Multi-armed Bandit with Local Search for MaxSAT.

[BibT_eX]

[DOI]

,

,

,

,

,

CoRR, 2022

Reinforcement learning based coarse-to-fine search for the maximum k-plex problem.

[BibT_eX]

[DOI]

,

,

,

Appl. Soft Comput., 2022

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit.

[BibT_eX]

[DOI]

,

,

,

,

,

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

2021

Late acceptance-based heuristic algorithms for identifying critical nodes of weighted graphs.

[BibT_eX]

[DOI]

,

,

,

Knowl. Based Syst., 2021

A Quasi-Newton-based Floorplanner for fixed-outline floorplanning.

[BibT_eX]

[DOI]

,

,

,

,

Comput. Oper. Res., 2021

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

The Orthogonal Packing and Scheduling Problem: Model, Heuristic, and Benchmark.

[BibT_eX]

[DOI]

,

,

,

,

IEEE Trans. Syst. Man Cybern. Syst., 2020

Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem.

[BibT_eX]

[DOI]

,

,

,

,

CoRR, 2020

Enumerating Maximal <i>k</i>-Plexes with Worst-Case Time Guarantee.

[BibT_eX]

[DOI]

,

,

,

,

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

2019

Solving the Latin Square Completion Problem by Memetic Graph Coloring.

[BibT_eX]

[DOI]

,

IEEE Trans. Evol. Comput., 2019

Effective reinforcement learning based local search for the maximum k-plex problem.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2019

2018

考虑时间因素的0-1背包调度问题 (0-1 Knapsack Variant with Time Scheduling).

[BibT_eX]

[DOI]

,

,

,

计算机科学, 2018

用于求解混合车辆路径问题的混合进化算法 (Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem).

[BibT_eX]

[DOI]

,

,

,

计算机科学, 2018

Packing unequal circles into a square container based on the narrow action spaces.

[BibT_eX]

[DOI]

,

,

,

Sci. China Inf. Sci., 2018

Minimum sum coloring for large graphs with extraction and backward expansion search.

[BibT_eX]

[DOI]

,

,

,

Appl. Soft Comput., 2018

2017

An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules.

[BibT_eX]

[DOI]

,

,

,

,

Comput. Oper. Res., 2017

Algorithms for the minimum sum coloring problem: a review.

[BibT_eX]

[DOI]

,

Jean-Philippe Hamiez

,

Artif. Intell. Rev., 2017

2016

Hybrid evolutionary search for the minimum sum coloring problem of graphs.

[BibT_eX]

[DOI]

,

Inf. Sci., 2016

2015

Hybrid metaheuristic algorithms for sum coloring and bandwidth coloring. (Métaheuristiques hybrides pour la somme coloration et la coloration de bande passante).

[BibT_eX]

[DOI]

PhD thesis, 2015

Effective Learning-Based Hybrid Search for Bandwidth Coloring.

[BibT_eX]

[DOI]

,

IEEE Trans. Syst. Man Cybern. Syst., 2015

General swap-based multiple neighborhood tabu search for the maximum independent set problem.

[BibT_eX]

[DOI]

,

Eng. Appl. Artif. Intell., 2015

2014

A memetic algorithm for the Minimum Sum Coloring Problem.

[BibT_eX]

[DOI]

,

,

Jean-Philippe Hamiez

Comput. Oper. Res., 2014

2013

Heuristics for two-dimensional strip packing problem with 90° rotations.

[BibT_eX]

[DOI]

,

,

Expert Syst. Appl., 2013

2012

An efficient deterministic heuristic for two-dimensional rectangular packing.

[BibT_eX]

[DOI]

,

,

Comput. Oper. Res., 2012

Loading...