Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Dragan Urosevic

dblp:43/3111 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0003-3607-6704ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5Theory of computation · 3Artificial intelligence and machine learning · 2 · 1 since 2021Systems, architecture and hardware · 1Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Motion planning and robot control · 77% Robot manipulation · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
robot control
0.011991
SYM-program environment for manipulator modeling, control and simulation · ICRA 1991
Robotics › Robot manipulation
manipulator modeling
0.011991
SYM-program environment for manipulator modeling, control and simulation · ICRA 1991

Methods — techniques the papers use, named apart from their topics

symbolic computation · 0.0
YearPublicationVenuePosition
2025 General Variable Neighborhood Search for Maximum Diversity Problem with Capacity and Budget Constraints
Luka Radanovic, Ana Mijovic, Dragan Urosevic, Tatjana Davidovic, Raka Jovanovic
Expert Syst. Appl.3
2020 Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach
Nenad Mladenovic, Dragan Urosevic, Jack Brimberg, Xinbao Liu
Inf. Sci.3
2019 Variable neighborhood search for stochastic linear programming problem with quantile criterion
Sergey V. Ivanov, Andrey I. Kibzun, Nenad Mladenovic, Dragan Urosevic
J. Glob. Optim.4
2017 Less is more: Solving the Max-Mean diversity problem with variable neighborhood search
Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic
Inf. Sci.4
2016 Less is more: Basic variable neighborhood search for minimum differential dispersion problem
Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic
Inf. Sci.3
2015 Solving the maximally diverse grouping problem by skewed general variable neighborhood search
Jack Brimberg, Nenad Mladenovic, Dragan Urosevic
Inf. Sci.3
2011 Variable neighbourhood search for resolving routing and wavelength assignment problem in optical wavelength-division multiplexing networks
abstract
The issue of finding optimal signal routes is one of the main challenges within the framework of optimal networks. This study aims at illustrating the development of a new, mixed-integer mathematical model for solving the static routing and wavelength assignment (RWA) problem in optical wavelength-division multiplexing (WDM) networks and presents the comparison of results obtained by heuristics and CPLEX commercial software. The objective function of the mathematical model is to minimise the blocking probability by maximising the number of successfully connected lightpaths. In this paper two WDM networks with full wavelength conversion nodes were tested. The proposed heuristics are the variable neighbourhood search (VNS) and tabu search (TS). Firstly, the authors compare the results obtained by these two heuristics and CPLEX on a low-complexity WDM network, aiming to determine whether these heuristics may yield results which approximate optimal results. Secondly, having illustrated that the heuristics provide satisfactory results, the authors run these heuristics on a high-complexity WDM network. The results indicate minor differences in blocking probability and show that in majority cases, VNS spends ten times less CPU time as opposed to TS. In conclusion, the authors argue that VNS heuristic is appropriate for resolving this static RWA problem.
Vladica Tintor, Dragan Urosevic, Bojana Andjelic, Jovan Radunovic, Nenad Mladenovic
IET Commun.2
2009 Solving large p-median clustering problems by primal-dual variable neighborhood search
Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic
Data Min. Knowl. Discov.3
2007 Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
abstract
The variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions. This leads to (i) heuristic resolution of (metric) instances with uniform fixed costs, up to n=15,000 users, and m=n potential locations for facilities with an error not exceeding 0.04%; (ii) exact solution of such instances with up to m=n=7,000; and (iii) exact solutions of instances with variable fixed costs and up to m=n=15,000.
Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic
INFORMS J. Comput.3
2004 Variable neighborhood search for the maximum clique
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
Discret. Appl. Math.3
1991 SYM-program environment for manipulator modeling, control and simulation
abstract
The structure of SYM, a program package for manipulator modeling, control law synthesis, and simulation, is described. SYM's research and educational aims are emphasized. The control law synthesis in symbolic form and the system simulation are discussed in detail. Several examples of SYM outputs which depict the main steps in the manipulator control system creation process, namely, manipulator structure as a 3-D scheme, control law definition form, and system simulation results as 2-D plots are presented.>
Aleksandar Timcenko, Nenad Kircanski, Dragan Urosevic, Miomir Vukobratovic
ICRA3