An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes

DOI10.1007/S11590-017-1184-ZzbMath1442.90194OpenAlexW2747029350MaRDI QIDQ2174878

Alain Hertz

Publication date: 27 April 2020

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1184-z

zbMATH Keywords

integer programminghypercubesmetric dimensiondoubly resolving sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (5)

Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension ⋮ Resolving sets and integer programs for recommender systems ⋮ On the metric dimension of the folded \(n\)-cube ⋮ A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem ⋮ On metric dimensions of hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the metric dimension of graphs by genetic algorithms
• Computing minimal doubly resolving sets of graphs
• Resolvability in graphs and the metric dimension of a graph
• Symmetry properties of resolving sets and metric bases in hypercubes
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Landmarks in graphs
• On the Metric Dimension of Cartesian Products of Graphs

This page was built for publication: An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes