Variable neighborhood search for metric dimension and minimal doubly resolving set problems
type: Item
instance of: scholarly article
title: Variable neighborhood search for metric dimension and minimal doubly resolving set problems
zbMATH Open document ID: 1253.90199
author: Jozef Kratica
author: Vera Kovačević-Vujčić
author: Mirjana Čangalović
author: Nenad Mladenović
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6119363
zbMATH Keywords: metaheuristics
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: metric dimension
zbMATH Keywords: minimal doubly resolving set
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.02.019
OpenAlex ID: W2074218695
cites work: Base size, metric dimension and other invariants of groups and graphs
cites work: On the metric dimension of Grassmann graphs
cites work: On the Metric Dimension of Cartesian Products of Graphs
cites work: On the metric dimension of infinite graphs
cites work: Q3070331
cites work: Resolvability in graphs and the metric dimension of a graph
cites work: The metric dimension and metric independence of a graph
cites work: PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
cites work: The metric dimension of Cayley digraphs
cites work: Solving large \(p\)-median problems with a radius formulation
cites work: Variable neighbourhood search: Methods and applications
cites work: Variable neighbourhood search: methods and applications
cites work: Q4119237
cites work: On Approximation Complexity of Metric Dimension Problem
cites work: On the metric dimension of some families of graphs
cites work: Extremal Graph Theory for Metric Dimension and Diameter
cites work: Extremal graph theory for metric dimension and diameter
cites work: Q3059024
cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: On families of convex polytopes with constant metric dimension
cites work: Q3512801
cites work: Landmarks in graphs
cites work: Formulation space search approach for the teacher/class timetabling problem
cites work: Computing strong metric dimension of some special classes of graphs by genetic algorithms
cites work: Computing the metric dimension of graphs by genetic algorithms
cites work: Computing minimal doubly resolving sets of graphs
cites work: The team orienteering problem with time windows: an LP-based granular variable neighborhood search
cites work: Minimum metric dimension of silicate networks.
cites work: Variable neighborhood search
cites work: Reformulation descent applied to circle packing problems
cites work: Formulation Space Search for Circle Packing Problems
cites work: Variable neighbourhood search for bandwidth reduction
cites work: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
cites work: A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
cites work: Q5488329
cites work: Metric Bases for Polyhedral Gauges
cites work: On Metric Generators of Graphs
cites work: Q4075485
cites work: A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
cites work: On the metric dimension of corona product graphs
DOI: 10.1016/J.EJOR.2012.02.019
description: scientific article; zbMATH DE number 6119363