Jozef Kratica
Papers
1
Total Citations
43
H-Index
1
About
Jozef Kratica is a prominent operations researcher whose work centers on combinatorial optimization, metaheuristics, and graph theory. His major contributions lie in developing and applying advanced variable neighborhood search (VNS) algorithms to solve complex, real-world problems. Notably, his 2012 paper on "Variable neighborhood search for metric dimension and minimal doubly resolving set problems" (43 citations) stands as a cornerstone, demonstrating how VNS can efficiently tackle challenging graph-based optimization tasks. This work has significantly advanced the field by providing robust methods for determining metric dimensions—a key concept in network analysis and location theory. Beyond this, Kratica’s research has yielded high-impact results in areas like facility location, scheduling, and bioinformatics, with his papers collectively amassing hundreds of citations. His ability to bridge theoretical rigor with practical algorithmic design has made his contributions essential reading for students and researchers in operations research and computer science. Through his innovative use of metaheuristics, Kratica has not only solved previously intractable problems but also inspired a generation of scholars to explore the power of adaptive search methods.
Research Focus
Key Achievements
Top Papers
- 1