Variable neighborhood search for metric dimension and minimal doubly resolving set problems
From MaRDI portal
Publication:1926742
DOI10.1016/j.ejor.2012.02.019zbMath1253.90199OpenAlexW2074218695MaRDI QIDQ1926742
Jozef Kratica, Vera V. Kovacevic-Vujcic, Mirjana Čangalović, Nenad Mladenović
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.02.019
combinatorial optimizationmetaheuristicsvariable neighborhood searchmetric dimensionminimal doubly resolving set
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Distance in graphs (05C12)
Related Items
Is it possible to determine a point lying in a simplex if we know the distances from the vertices? ⋮ An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes ⋮ Symmetry properties of resolving sets and metric bases in hypercubes ⋮ A metaheuristic approach to the dominating tree problem ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Approximation for the minimum cost doubly resolving set problem ⋮ Resolvability of Hamming Graphs ⋮ A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems ⋮ Low-dimensional representation of genomic sequences ⋮ A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem ⋮ Variable neighborhood search for the strong metric dimension problem ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ The doubly metric dimension of cylinder graphs and torus graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- On families of convex polytopes with constant metric dimension
- On the metric dimension of corona product graphs
- The metric dimension of Cayley digraphs
- Computing the metric dimension of graphs by genetic algorithms
- Variable neighbourhood search: methods and applications
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Computing minimal doubly resolving sets of graphs
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search
- Resolvability in graphs and the metric dimension of a graph
- Reformulation descent applied to circle packing problems
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- Variable neighbourhood search for bandwidth reduction
- Extremal graph theory for metric dimension and diameter
- Landmarks in graphs
- On the Metric Dimension of Infinite Graphs
- Solving Large p-Median Problems with a Radius Formulation
- On Approximation Complexity of Metric Dimension Problem
- Metric Bases for Polyhedral Gauges
- Base size, metric dimension and other invariants of groups and graphs
- On the metric dimension of some families of graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Extremal Graph Theory for Metric Dimension and Diameter
- Formulation space search approach for the teacher/class timetabling problem
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- On the metric dimension of Grassmann graphs
- Formulation Space Search for Circle Packing Problems
- On Metric Generators of Graphs
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
