An exact solution framework for the minimum cost dominating tree problem

DOI10.1007/s11590-018-1252-zzbMath1407.90322OpenAlexW2793678047MaRDI QIDQ1800452

Martin Luipersbeck, Markus Sinnl, Eduardo Álvarez-Miranda

Publication date: 23 October 2018

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

Full work available at URL: https://doi.org/10.1007/s11590-018-1252-z

zbMATH Keywords

branch-and-cutdominating treeprimal-dual heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Models for minimum cost dominating trees
• Numerical investigation of the new regenerator-recuperator scheme of VOC oxidizer
• An exact algorithm for the maximum leaf spanning tree problem.
• A metaheuristic approach to the dominating tree problem
• Thinning out Steiner trees: a node-based model for uniform edge costs
• An algorithmic framework for the exact solution of tree-star problems
• On approximation of dominating tree in wireless sensor networks
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• The regenerator location problem
• A dual ascent approach for steiner tree problems on a directed graph
• A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
• Improved algorithms for the Steiner problem in networks

This page was built for publication: An exact solution framework for the minimum cost dominating tree problem