researcher

Jin-Kao Hao

Department of Computer Science, LERIA Laboratory, University of Angers, Angers, France

21 papers hereh-index 5711.6k citations314 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

middle author8
last author13

Across the 21 of 21 papers where every author was matched, so the position is known.

fields

affiliations

Department of Computer Science, LERIA Laboratory, University of Angers, Angers, France

Homepage

same name

Jin-Kao Hao — 9 papers, h 18
Jin-Kao Hao — 5 papers, h 2
Jin-Kao Hao — 3 papers, h 3
Jin-Kao Hao — 2 papers, h 2
Jin-Kao Hao — 2 papers, h 1
Jin-Kao Hao — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20132022

most citedA memetic algorithm for the minimum sum coloring problem

42 citations · 123 across the 21 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

cs.DM2015

A Multiple Search Operator Heuristic for the Max-k-cut Problem

Fuda Ma, Jin-Kao Hao

The max-k-cut problem is to partition the vertices of a weighted graph $G = (V, E)$ into $k \geq 2$ disjoint subsets such that the weight sum of the edges crossing the different subse…

cs.DM2015★ 33 cited

Algorithms for the minimum sum coloring problem: a review

Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao

The Minimum Sum Coloring Problem (MSCP) is a variant of the well-known vertex coloring problem which has a number of AI related applications. Due to its theoretical and practical r…

cs.AI2015

On memetic search for the max-mean dispersion problem

Xiangjing Lai, Jin-Kao Hao

Given a set $V$ of $n$ elements and a distance matrix $[d_{ij}]_{n \times n}$ among elements, the max-mean dispersion problem (MaxMeanDP) consists in selecting a subset $M$ from $V$ …