research
∙
09/02/2023
A double-decomposition based parallel exact algorithm for the feedback length minimization problem
Product development projects usually contain many interrelated activitie...
share
research
∙
04/24/2023
Combining Monte Carlo Tree Search and Heuristic Search for Weighted Vertex Coloring
This work investigates the Monte Carlo Tree Search (MCTS) method combine...
research
∙
02/24/2022
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
The Steiner tree problem, which asks for a minimum weighted tree spannin...
research
∙
02/03/2022
On Monte Carlo Tree Search for Weighted Vertex Coloring
This work presents the first study of using the popular Monte Carlo Tree...
research
∙
01/11/2022
Heuristic Search for Rank Aggregation with Application to Label Ranking
Rank aggregation aims to combine the preference rankings of a number of ...
research
∙
09/13/2021
A deep learning guided memetic framework for graph coloring problems
Given an undirected graph G=(V,E) with a set of vertices V and a set of ...
research
∙
03/18/2021
Massively parallel hybrid search for the partial Latin square extension problem
The partial Latin square extension problem is to fill as many as possibl...
research
∙
01/12/2021
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
The disjunctively constrained knapsack problem consists in packing a sub...
research
∙
07/12/2020
Probability Learning based Tabu Search for the Budgeted Maximum Coverage Problem
Knapsack problems are classic models that can formulate a wide range of ...
research
∙
07/10/2020
Solving the Clustered Traveling Salesman Problem via TSP methods
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popu...
research
∙
09/12/2019
Variable Population Memetic Search: A Case Study on the Critical Node Problem
Population-based memetic algorithms have been successfully applied to so...
research
∙
09/05/2019
Gradient Descent based Weight Learning for Grouping Problems: Application on Graph Coloring and Equitable Graph Coloring
A grouping problem involves partitioning a set of items into mutually di...
research
∙
03/12/2019
Iterated two-phase local search for the Set-Union Knapsack Problem
The Set-union Knapsack Problem (SUKP) is a generalization of the popular...
research
∙
08/17/2017
When data mining meets optimization: A case study on the quadratic assignment problem
This paper presents a hybrid approach called frequent pattern based sear...
research
∙
05/20/2017
Combining tabu search and graph reduction to solve the maximum balanced biclique problem
The Maximum Balanced Biclique Problem is a well-known graph model with r...
research
∙
05/11/2017
Memetic search for identifying critical nodes in sparse graphs
Critical node problems involve identifying a subset of critical nodes fr...
research
∙
04/01/2016
Reinforcement learning based local search for grouping problems: A case study on graph coloring
Grouping problems aim to partition a set of items into multiple mutually...
research
∙
03/03/2015
On memetic search for the max-mean dispersion problem
Given a set V of n elements and a distance matrix [d_ij]_n× n among elem...
research
∙
05/18/2014
A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs
This paper introduces an effective memetic algorithm for the linear orde...
research
∙
05/18/2014
A Multi-parent Memetic Algorithm for the Linear Ordering Problem
In this paper, we present a multi-parent memetic algorithm (denoted by M...
research
∙
02/06/2014
