Vera Kovačevíc-Vujčić
Papers
1
Total Citations
43
H-Index
1
About
Vera Kovačevíc-Vujčić is a distinguished researcher in combinatorial optimization, with a particular focus on metaheuristic algorithms and graph theory. Her most influential work centers on the development and application of variable neighborhood search (VNS) techniques to solve complex graph problems, notably the metric dimension and minimal doubly resolving set problems. In her highly cited 2012 paper, she introduced innovative VNS-based approaches that efficiently tackled these computationally challenging problems, achieving near-optimal solutions for large-scale instances. This work, which has garnered 43 citations, exemplifies her ability to bridge algorithmic design with practical problem-solving in network analysis and location theory. Kovačevíc-Vujčić’s contributions have advanced the understanding of how metaheuristics can be tailored to exploit problem-specific structures, making her a key figure in the optimization community. Her research continues to inspire further developments in discrete mathematics and operations research, offering robust tools for applications ranging from telecommunications to sensor placement.
Research Focus
Key Achievements
Top Papers
- 1