33 citations · 58 across the 5 of their papers we have counts for
5 papers
Topologically sensitive metaheuristics
Aleksandar Kartelj, Vladimir Filipović, Siniša Vrećica +1
This paper proposes topologically sensitive metaheuristics, and describes conceptual design of topologically sensitive Variable Neighborhood Search method (TVNS) and topologically…
An Integer Linear Programming Formulation for the Convex Dominating Set Problems
Jozef Kratica, Vladimir Filipovic, Dragan Matic +1
Due to their importance in practice, dominating set problems in graphs have been greatly studied in past and different formulations of these problems are presented in literature. T…
Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted -plexes
Milana Grbić, Aleksandar Kartelj, Savka Janković +2
In a network, a -plex represents a subset of vertices where the degree of each vertex in the subnetwork induced by this subset is at least . The maximum edge-weight …
Edge metric dimension of some generalized Petersen graphs
Vladimir Filipovic. Aleksandar Kartelj, Jozef Kratica
The edge metric dimension problem was recently introduced, which initiated the study of its mathematical properties. The theoretical properties of the edge metric representations a…
Variable Neighborhood Search for solving Bandwidth Coloring Problem
Dragan Matic, Jozef Kratica, Vladimir Filipovic
This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are general…