Product development projects usually contain many interrelated activitie...
This work investigates the Monte Carlo Tree Search (MCTS) method combine...
The Steiner tree problem, which asks for a minimum weighted tree spannin...
This work presents the first study of using the popular Monte Carlo Tree...
Rank aggregation aims to combine the preference rankings of a number of
...
Given an undirected graph G=(V,E) with a set of vertices V and a set of
...
The partial Latin square extension problem is to fill as many as possibl...
The disjunctively constrained knapsack problem consists in packing a sub...
Knapsack problems are classic models that can formulate a wide range of
...
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popu...
Population-based memetic algorithms have been successfully applied to so...
A grouping problem involves partitioning a set of items into mutually
di...
The Set-union Knapsack Problem (SUKP) is a generalization of the popular...
This paper presents a hybrid approach called frequent pattern based sear...
The Maximum Balanced Biclique Problem is a well-known graph model with
r...
Critical node problems involve identifying a subset of critical nodes fr...
Grouping problems aim to partition a set of items into multiple mutually...
Given a set V of n elements and a distance matrix [d_ij]_n× n
among elem...
This paper introduces an effective memetic algorithm for the linear orde...
In this paper, we present a multi-parent memetic algorithm (denoted by M...
Given an undirected graph with costs associated with each edge as well a...