You need to log in to edit.

You can create a new account if you don't have one.

Or, discuss a change on Slack.

You can create a new account if you don't have one.

Or, discuss a change on Slack.

1 code implementation • 23 Jun 2023 • Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao, Jin-Kao Hao

We define a novel parameter of the input instance, $g_k(G)$, the gap between the degeneracy bound and the size of the maximum $k$-plex in the given graph, and present an exact algorithm parameterized by this $g_k(G)$, which has a worst-case running time polynomial in the size of the input graph and exponential in $g_k(G)$.

1 code implementation • 24 Apr 2023 • Cyril Grelier, Olivier Goudet, Jin-Kao Hao

This work investigates the Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem.

1 code implementation • 3 Feb 2022 • Cyril Grelier, Olivier Goudet, Jin-Kao Hao

This work presents the first study of using the popular Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem.

no code implementations • 11 Jan 2022 • Yangming Zhou, Jin-Kao Hao, Zhen Li, Fred Glover

Rank aggregation aims to combine the preference rankings of a number of alternatives from different voters into a single consensus ranking.

1 code implementation • 9 Nov 2021 • Jintong Ren, Jin-Kao Hao, Feng Wu, Zhang-Hua Fu

As an extension of the traveling repairman problem with profits, the multiple traveling repairman problem with profits consists of multiple repairmen who visit a subset of all customers to maximize the revenues collected through the visited customers.

no code implementations • 13 Sep 2021 • Olivier Goudet, Cyril Grelier, Jin-Kao Hao

Given an undirected graph $G=(V, E)$ with a set of vertices $V$ and a set of edges $E$, a graph coloring problem involves finding a partition of the vertices into different independent sets.

no code implementations • 18 Mar 2021 • Olivier Goudet, Jin-Kao Hao

The partial Latin square extension problem is to fill as many as possible empty cells of a partially filled Latin square.

no code implementations • 12 Jan 2021 • Zequn Wei, Jin-Kao Hao

The disjunctively constrained knapsack problem consists in packing a subset of pairwisely compatible items in a capacity-constrained knapsack such that the total profit of the selected items is maximized while satisfying the knapsack capacity.

no code implementations • 12 Jul 2020 • Liwen Li, Zequn Wei, Jin-Kao Hao, Kun He

As the counterpart problem of SUKP, however, BMCP was introduced early in 1999 but since then it has been rarely studied, especially there is no practical algorithm proposed.

no code implementations • 10 Jul 2020 • Yongliang Lu, Jin-Kao Hao, Qinghua Wu

The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications.

no code implementations • 12 Sep 2019 • Yangming Zhou, Jin-Kao Hao, Zhang-Hua Fu, Zhe Wang, Xiangjing Lai

Population-based memetic algorithms have been successfully applied to solve many difficult combinatorial problems.

1 code implementation • 5 Sep 2019 • Olivier Goudet, Béatrice Duval, Jin-Kao Hao

Unlike existing methods for graph coloring that are specific to the considered problem, the presented work targets a generic objective by introducing a unified method that can be applied to different graph coloring problems.

no code implementations • 12 Mar 2019 • Zequn Wei, Jin-Kao Hao

The Set-union Knapsack Problem (SUKP) is a generalization of the popular 0-1 knapsack problem.

no code implementations • 20 May 2017 • Yi Zhou, Jin-Kao Hao

The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains.

no code implementations • 11 May 2017 • Yangming Zhou, Jin-Kao Hao, Fred Glover

In this paper, we study the classic critical node problem (CNP) and introduce an effective memetic algorithm for solving CNP.

no code implementations • 23 Mar 2017 • 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 optimization.

no code implementations • 1 Apr 2016 • 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.

no code implementations • 3 Mar 2015 • Xiangjing Lai, Jin-Kao Hao

Computational experiments on the set of 160 benchmark instances with up to 1000 elements commonly used in the literature show that the proposed algorithm improves or matches the published best known results for all instances in a short computing time, with only one exception, while achieving a high success rate of 100\%.

no code implementations • 18 May 2014 • Tao Ye, Tao Wang, Zhipeng Lu, Jin-Kao Hao

In this paper, we present a multi-parent memetic algorithm (denoted by MPM) for solving the classic Linear Ordering Problem (LOP).

no code implementations • 18 May 2014 • Tao Ye, Kan Zhou, Zhipeng Lu, Jin-Kao Hao

This paper introduces an effective memetic algorithm for the linear ordering problem with cumulative costs.

no code implementations • 6 Feb 2014 • 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 tree of minimum total cost.

Cannot find the paper you are looking for? You can
Submit a new open access paper.

Contact us on:
hello@paperswithcode.com
.
Papers With Code is a free resource with all data licensed under CC-BY-SA.