Variable neighborhood search for metric dimension and minimal doubly resolving set problems

descriptionPublicationkeyboard_double_arrow_right Article 01 Jul 2012 English Publisher:Elsevier BVJournal:European Journal of Operational Research, volume 220, pages 328-337 (issn: 0377-2217,

Copyright policy )Funded by:MESTD | Mathematical Modelas and ..., MESTD | Graph theory and mathemat...

Authors: Nenad Mladenovic; Jozef Kratica; Vera Kovacevic-Vujcic; Mirjana Cangalovic;

doi: 10.1016/j.ejor.2012.02.019

Variable neighborhood search for metric dimension and minimal doubly resolving set problems

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

University of Belgrade
Serbia
Serbian Academy of Sciences and Arts
Serbia
Brunel University London
United Kingdom

Keywords

metaheuristics, Combinatorial optimization, Distance in graphs, minimal doubly resolving set, combinatorial optimization, Programming involving graphs or networks, Approximation methods and heuristics in mathematical programming, variable neighborhood search, metric dimension

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	28
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%