Jin-Kao Hao

Distinguished Professor

Université d'Angers

France

Research Interests

Explore related searches

Professors in France

Contact this professor

ORCID

Google Scholar

About

Professor Jin-Kao Hao is a Distinguished Professor at Université Angers UFR Sciences, France. His research focuses on optimization problems, including resource allocation in cloud computing, traveling salesman issues, and optimization algorithms for various applications. Recent publications highlight his work on local search algorithms, evolutionary strategies, and structural optimization methodologies.

Jin-Kao Hao

Research Interests

Explore related searches

Contact this professor

About

Articles (30)

Heterogeneous cloud resource allocation: a case study on real-time transcoding in live streaming

Learning-guided iterated local search for the minmax multiple traveling salesman problem

A cardinality constrained iterated local search for the virtual machine placement problem

An effective evolutionary algorithm for packing rectangles into a fixed size circular container

Enhanced open-source scatter search algorithm for solving quadratic unconstrained binary optimization problems

A heuristic algorithm with multi-scale perturbations for point arrangement and equal circle packing in a convex container

Structural optimization of atomic clusters using iterated dynamic lattice search: With application to silver clusters

A Hybrid Genetic Algorithm with Multi-Population for Capacitated Location Routing

An Efficient Optimization Model and Tabu Search–Based Global Optimization Approach for the Continuous p-Dispersion Problem

Code and Data Repository for A Hybrid Genetic Algorithm with Multi-population for Capacitated Location Routing

A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment

Multi-objective general variable neighborhood search for software maintainability optimization

A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem

An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints

A large population island framework for the unconstrained binary quadratic problem

Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits

Solving the patient admission scheduling problem using constraint aggregation

A knowledge-based iterated local search for the weighted total domination problem

Exact and heuristic solution approaches for the Generalized Independent Set Problem

Learning driven three-phase search for the maximum independent union of cliques problem

A hybrid genetic algorithm for the Hamiltonian p‐median problem

A massively parallel evolutionary algorithm for the partial Latin square extension problem

Hybrid genetic algorithm for undirected traveling salesman problems with profits

Breakout local search for the traveling salesman problem with job-times

Responsive strategic oscillation for solving the disjunctively constrained knapsack problem

Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search

Software/Code for "Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search"

An effective hybrid evolutionary algorithm for the clustered orienteering problem

Solution-based tabu search for the capacitated dispersion problem

Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres

Collaborators (4)

Fred Glover

Javier Yuste

Eduardo G. Pardo

Abraham DUARTE

How do I reach out?

Meet Kite AI