45 citations · 115 across the 9 of their papers we have counts for
9 papers
Fixed set search applied to the traveling salesman problem
Raka Jovanovic, Milan Tuba, Stefan Voss
In this paper we present a new population based metaheuristic called the fixed set search (FSS). The proposed approach represents a method of adding a learning mechanism to the gre…
A GRASP approach for solving the 2-connected m-dominating set problem
Raka Jovanovic, Islam Safak Bayram, Stefan Voss
In this paper, we present a constructive heuristic algorithm for the -connected -dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is…
A heuristic approach for dividing graphs into bi-connected components with a size constraint
Raka Jovanovic, Tatsushi Nishi, Stefan Voss
In this paper we propose a new problem of finding the maximal bi-connected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions…
Correction to kinetic energy density using exactly solvable model
Alexey Sergeev, Raka Jovanovic, Sabre Kais +1
An accurate non-gradient-expansion based correction to Thomas--Fermi is developed using solvable model. The used model is a system of non-interacting electrons moving independe…
An Ant Colony Optimization Algorithm for Partitioning Graphs with Supply and Demand
Raka Jovanovic, Milan Tuba, Stefan Voss
In this paper we focus on finding high quality solutions for the problem of maximum partitioning of graphs with supply and demand (MPGSD). There is a growing interest for the MPGSD…
A Heuristic Method for Solving the Problem of Partitioning Graphs with Supply and Demand
Raka Jovanovic, Abdelkader Bousselham, Stefan Voss
In this paper we present a greedy algorithm for solving the problem of the maximum partitioning of graphs with supply and demand (MPGSD). The goal of the method is to solve the MPG…