42 citations · 123 across the 21 of their papers we have counts for
8 papers · 1 filter
When data mining meets optimization: A case study on the quadratic assignment problem
Yangming Zhou, Jin-Kao Hao, Béatrice Duval
This paper presents a hybrid approach called frequent pattern based search that combines data mining and optimization. The proposed method uses a data mining procedure to mine freq…
Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem
Yi Zhou, André Rossi, Jin-Kao Hao
The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ide…
An iterated local search algorithm for the minimum differential dispersion problem
Yangming Zhou, Jin-Kao Hao
Given a set of elements separated by a pairwise distance matrix, the minimum differential dispersion problem (Min-Diff DP) aims to identify a subset of m elements (m < n) such…
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 into disjoint subsets such that the weight sum of the edges crossing the different subse…
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…
Path Relinking for Bandwidth Coloring Problem
Xiangjing Lai, Zhipeng Lu, Jin-Kao Hao +2
A Path Relinking algorithm is proposed for the Bandwidth Coloring problem and the Bandwidth MultiColoring problem. It combines a population based relinking method and a tabu search…
A memetic algorithm for the minimum sum coloring problem
Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez
Given an undirected graph , the Minimum Sum Coloring problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of such that the…
Improved Lower Bounds for Sum Coloring via Clique Decomposition
Qinghua Wu, Jin-Kao Hao
Given an undirected graph with a set of vertices and a set of edges, the minimum sum coloring problem (MSCP) is to find a legal vertex coloring of , using co…