42 citations · 123 across the 21 of their papers we have counts for
21 papers
Heuristic Search for Rank Aggregation with Application to Label Ranking
Yangming Zhou, Jin-Kao Hao, Zhen Li +1
Rank aggregation aims to combine the preference rankings of a number of alternatives from different voters into a single consensus ranking. As a useful model for a variety of pract…
Variable Population Memetic Search: A Case Study on the Critical Node Problem
Yangming Zhou, Jin-Kao Hao, Zhang-Hua Fu +2
Population-based memetic algorithms have been successfully applied to solve many difficult combinatorial problems. Often, a population of fixed size was used in such algorithms to…
Population-based Gradient Descent Weight Learning for Graph Coloring Problems
Olivier Goudet, Béatrice Duval, Jin-Kao Hao
Graph coloring involves assigning colors to the vertices of a graph such that two vertices linked by an edge receive different colors. Graph coloring problems are general models th…
Iterated two-phase local search for the Set-Union Knapsack Problem
Zequn Wei, Jin-Kao Hao
The Set-union Knapsack Problem (SUKP) is a generalization of the popular 0-1 knapsack problem. Given a set of weighted elements and a set of items with profits where each item is c…
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…
Combining tabu search and graph reduction to solve the maximum balanced biclique problem
Yi Zhou, Jin-Kao Hao
The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algorithm, which combines an effectiv…
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…
Memetic search for identifying critical nodes in sparse graphs
Yangming Zhou, Jin-Kao Hao, Fred Glover
Critical node problems involve identifying a subset of critical nodes from an undirected graph whose removal results in optimizing a pre-defined measure over the residual graph. As…
Diversification-Based Learning in Computing and Optimization
Fred Glover, Jin-Kao Hao
Diversification-Based Learning (DBL) derives from a collection of principles and methods introduced in the field of metaheuristics that have broad applications in computing and opt…
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…
Reinforcement learning based local search for grouping problems: A case study on graph coloring
Yangming Zhou, Jin-Kao Hao, Béatrice Duval
Grouping problems aim to partition a set of items into multiple mutually disjoint subsets according to some specific criterion and constraints. Grouping problems cover a large clas…
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…
On memetic search for the max-mean dispersion problem
Xiangjing Lai, Jin-Kao Hao
Given a set of elements and a distance matrix among elements, the max-mean dispersion problem (MaxMeanDP) consists in selecting a subset from …
A note on a sports league scheduling problem
Jean-Philippe Hamiez, Jin-Kao Hao
Sports league scheduling is a difficult task in the general case. In this short note, we report two improvements to an existing enumerative search algorithm for a NP-hard sports le…
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 Multi-parent Memetic Algorithm for the Linear Ordering Problem
Tao Ye, Tao Wang, Zhipeng Lu +1
In this paper, we present a multi-parent memetic algorithm (denoted by MPM) for solving the classic Linear Ordering Problem (LOP). The MPM algorithm integrates in particular a mult…
A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem
Zhang-Hua Fu, Jin-Kao Hao
Given an undirected graph with costs associated with each edge as well as each pair of edges, the quadratic minimum spanning tree problem (QMSTP) consists of determining a spanning…
Solving the minimum sum coloring problem via binary quadratic programming
Yang Wang, Jin-Kao Hao, Fred Glover +1
In recent years, binary quadratic programming (BQP) has been successively applied to solve several combinatorial optimization problems. We consider in this paper a study of using t…
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…