Minimum weight clustered dominating tree problem

DOI10.1016/j.ejor.2022.08.014OpenAlexW4292417672WikidataQ114184250 ScholiaQ114184250MaRDI QIDQ6109249

Pablo Adasme, Rafael Castro de Andrade

Publication date: 3 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.08.014

zbMATH Keywords

combinatorial optimizationvalid inequalitiesclustered network design

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A note on two problems in connexion with graphs
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
• Unit disk graphs
• Geometric algorithms and combinatorial optimization
• A smaller extended formulation for the odd cycle inequalities of the stable set polytope
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• On the independent dominating set polytope
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
• Maximal Flow Through a Network
• Integer Programming Formulation of Traveling Salesman Problems

This page was built for publication: Minimum weight clustered dominating tree problem