Juntao Zhao

Orcid: 0000-0001-9794-3707

Affiliations:
  • Northeastern University, Shenyang, China


According to our database1, Juntao Zhao authored at least 7 papers between 2024 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
An Effective Iterated Search for the Profitable Tour Problem With Simultaneous Pickup and Delivery.
IEEE Trans. Intell. Transp. Syst., November, 2025

Reinforcement learning-enhanced variable neighborhood search strategies for the k-clustering minimum biclique completion problem.
Comput. Oper. Res., 2025

A population-based simulated annealing approach with adaptive mutation operator for solving the discounted {0-1} knapsack problem.
Appl. Soft Comput., 2025

2024
An adaptive evolutionary search-based method for efficiently tackling the set-union knapsack problem.
Inf. Sci., 2024

An incremental method-based machine learning approach for max-min knapsack with multiple scenarios.
Comput. Ind. Eng., 2024

Tackling the Generalized Max-Mean Dispersion Problem with a Hybrid Population Method.
Proceedings of the 10th International Conference on Control, 2024

A Cooperative Method for Solving the Set-Union Knapsack Problem.
Proceedings of the 10th International Conference on Control, 2024


  Loading...