Aiming at selecting a small subset of nodes with maximum influence on networks, the
influence maximization (IM) problem has been extensively studied. Since it is# P-hard to …

Influence Maximization (IM) is a classical combinatorial optimization problem, which can be
widely used in mobile networks, social computing, and recommendation systems. It aims at …

Complex networks pervade various real-world systems, from the natural environment to
human societies. The essence of these networks is in their ability to transition and evolve …

Graph partitioning aims to divide a graph into $ k $ disjoint subsets while optimizing a
specific partitioning objective. The majority of formulations related to graph partitioning …

Abstract The Influence Maximization (IM) problem, which seeks to select a small number of
users to maximize the influence spread across the social network, has been widely studied …

The graph colouring problem consists of assigning labels, or colours, to the vertices of a
graph such that no two adjacent vertices share the same colour. In this work we investigate …

Deep models have shown promising results in solving vehicle routing problems (VRPs).
However, existing models are often trained on instances from specific distributions and their …

In recent two decades, online social platforms have become more and more popular, and
the dissemination of information on social networks has attracted wide attention of the …

Identifying influential individuals in information dissemination is an important topic in social
network research; however, most studies have difficulty in effectively identifying influential …

Machine scheduling problems are one of the important issues in manufacturing systems. In
particular, in complex conditions such as job split and machine eligibility constraint, it …