In this paper, two similar NP-hard optimization problems on graphs are considered: the metric dimension problem and the problem of determining a doubly ...

In this paper, two similar NP-hard optimization problems on graphs are considered: the metric dimension problem and the problem of determining a doubly ...

In this paper, two similar NP-hard optimization problems on graphs are considered: the metric dimension problem and the problem of determining a doubly ...

Variable neighborhood search for metric dimension and minimal doubly resolving set problems. Mladenovic, Nenad. Montréal :GERAD HEC Montréal,2011. 2011. eng.

Feb 12, 2024 · In this paper, two similar NP-hard optimization problems on graphs are considered: the metric dimension problem and the problem of determining a doubly ...

In this paper, two similar NP-hard optimization problems on graphs are considered: the metric dimension problem and the problem of determining a doubly ...

In this paper we consider two similar NP-hard optimization problems on graphs: the metric dimension problem and the problem of determining minimal doubly ...

We consider a variable neighborhood search approach for solving the strong metric dimension problem. The proposed method is based on the idea of ...

A variable neighborhood search (VNS) based heuristic is developed to solve the dominating tree problem on graphs by using the set of vertex permutations ...

Aug 14, 2018 · There, two combinatorial optimization problems on the graph are considered: metric dimension problem and minimal doubly resolving set problem.