Grouping problems are a special type of combinatorial optimization problems that have
gained great relevance because of their numerous real-world applications. The solution …

Variable neighborhood search is a local search metaheuristic that uses sequentially
different neighborhood structures. This method has been successfully applied to various …

The design of the novel metaheuristic method, called Topological Variable Neighborhood
Search, is presented and its theoretical properties are elaborated. The proposed …

Structured data are one of the most important segments in the realm of big data analysis that
have undeniably prevailed over the years. In recent years, column-oriented design has …

This article proposes a heuristic for the fixed spectrum frequency assignment (FS-FA)
problem of telecommunications networks. A network composes of many connections, and …

Partitioning biological network into smaller components can help in retrieving new
information of a particular biological structure. In this research we investigate the problem of …

Many problems of practical and theoretical importance within the fields of Artificial
Intelligence and Operations Research are combinatorial. Combinatorial optimization …

Bandwidth consecutive multicoloring problem is also known as a b-coloring problem. Let
G=(V, E) be a graph where V is the set of vertices and E is the set of edges. Let each vertex v …

arXiv:2002.11164v1 [cs.AI] 25 Feb 2020 Page 1 arXiv:2002.11164v1 [cs.AI] 25 Feb 2020
Topologically sensitive metaheuristics Aleksandar Kartelja, Vladimir Filipovica, Siniša Vrecicaa …

This article proposes a heuristic for the fixed spectrum frequency assignment (FS-FA)
problem of telecommunications networks. A network composes of many connections, and …