A decomposition approach for solving a broadcast domination network design problem-Reference-Cited by-同舟云学术

A decomposition approach for solving a broadcast domination network design problem

Published:2011-09-21 Issue:1 Volume:210 Page:333-360
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Shen Siqian,Smith J. Cole

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

http://link.springer.com/content/pdf/10.1007/s10479-011-0962-8.pdf

Reference38 articles.

1. Benders, J. F. (1962). Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik, 4(1), 238–252.

2. Berge, C. (1962). Theory of graphs and its applications. New York: Wiley.

3. Blair, J. R. S., & Horton, S. B. (2005). Broadcast covers in graphs. Congressus Numerantium, 173, 109–115.

4. Blair, J. R. S., Heggernes, P., Horton, S., & Manne, F. (2004). Broadcast domination algorithms for interval graphs, series-parallel graphs, and trees. Congressus Numerantium, 169, 55–77.

5. Lecture notes in computer science;H. Cambazard,2005

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Leaf sector covers with applications on circle graphs;Theoretical Computer Science;2024-07

2. Linear-Time Algorithm for Paired-Domination on Distance-Hereditary Graphs;Lecture Notes in Computer Science;2022

3. Logic-Based Benders Decomposition for Large-Scale Optimization;Springer Optimization and Its Applications;2019

4. Loss-constrained minimum cost flow under arc failure uncertainty with applications in risk-aware kidney exchange;IIE Transactions;2015-01-13

5. Solution of preemptive multi-objective network design problems applying Benders decomposition method;Annals of Operations Research;2013-04-05