Mirjana Čangalović
Papers
1
Total Citations
43
H-Index
1
About
Mirjana Čangalović is a distinguished researcher in combinatorial optimization and operations research, with a particular focus on graph theory and metaheuristic algorithms. Her major contributions lie in the development of variable neighborhood search (VNS) methods for solving complex graph problems, most notably the metric dimension and minimal doubly resolving set problems. Her seminal 2012 paper on this topic has garnered 43 citations, reflecting its lasting influence on the field. Čangalović’s work bridges theoretical graph theory and practical algorithmic design, offering efficient solutions for problems with applications in network analysis, location theory, and sensor placement. Beyond this, she has contributed to the study of graph invariants, including domination and independence numbers, and has explored the use of exact and heuristic methods for combinatorial challenges. Her research is characterized by rigorous mathematical analysis combined with computational experimentation, making her findings both theoretically sound and practically applicable. For students and researchers, Čangalović’s work exemplifies how innovative algorithmic strategies can unlock solutions to long-standing graph-theoretic problems, inspiring further exploration in optimization and discrete mathematics.
Research Focus
Key Achievements
Top Papers
- 1