A metaheuristic approach to the dominating tree problem

DOI10.1007/s11590-016-1017-5zbMath1382.90086OpenAlexW2291832039MaRDI QIDQ1677304

Mirjana Čangalović, Zorica Dražić, Vera V. Kovacevic-Vujcic

Publication date: 10 November 2017

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

Full work available at URL: https://doi.org/10.1007/s11590-016-1017-5

zbMATH Keywords

optimizationgraphsvariable neighborhood searchdominating tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Editorial. CEJOR special issue of Croatian Operational Research Society ⋮ An exact solution framework for the minimum cost dominating tree problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Approximating the tree and tour covers of a graph
• Variable neighbourhood search: methods and applications
• Numerical investigation of the new regenerator-recuperator scheme of VOC oxidizer
• Variable neighbourhood search: Methods and applications
• Variable neighborhood search
• Approximation algorithms for connected dominating sets
• On approximability of the independent/connected edge dominating set problems
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• On approximation of dominating tree in wireless sensor networks
• Variable neighborhood search for the strong metric dimension problem
• How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover

This page was built for publication: A metaheuristic approach to the dominating tree problem