Variable neighborhood search for metric dimension and minimal doubly resolving set problems

► An efficient VNS to solving the MDP and MDRSP is presented. ► VNS approach is based on a decomposition with an auxiliary objective function. ► Local search is implemented very efficiently. ► Experimental comparison with genetic algorithm indicates superiority of VNS approach.