Pages that link to "Item:Q1926742"
From MaRDI portal
The following pages link to Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742):
Displaying 13 items.
- Is it possible to determine a point lying in a simplex if we know the distances from the vertices? (Q268543) (← links)
- Approximation for the minimum cost doubly resolving set problem (Q896151) (← links)
- Symmetry properties of resolving sets and metric bases in hypercubes (Q1677292) (← links)
- A metaheuristic approach to the dominating tree problem (Q1677304) (← links)
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem (Q2065777) (← links)
- The doubly metric dimension of cylinder graphs and torus graphs (Q2107131) (← links)
- An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes (Q2174878) (← links)
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)
- Low-dimensional representation of genomic sequences (Q2311893) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
- Variable neighborhood search for the strong metric dimension problem (Q2840752) (← links)
- Resolvability of Hamming Graphs (Q5128504) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
