.png){kind=icon}
返回
Optimal multicast route packing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.03.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers the hop-constrained multicast route packing problem with a bandwidth reservation to build QOS-guaranteed multicast routing trees with a minimum installation cost. Given a set of multicast sessions. each of which has a hop limit constraint and a bandwidth requirement, the problem is to determine the set of multicast routing trees in an arc-capacitated network with the objective of minimizing the cost. For the problem, we propose a branch-and-cut-and-price algorithm, which can be viewed as a branch-and-bound method incorporating both the strong cutting plane algorithm and the column generation method. We implemented and tested the proposed algorithm on randomly generated problem instances with sizes up to 30 nodes. 570 arcs, and 10 multicast sessions. The test results show that the algorithm can obtain the optimal Solution to practically sized problem instances within a reasonable time limit in most cases (C) 2008 Elsevier B.V. All rights reserved
Keyword:
Integer programming
Multicast
Optimization
Column generation
Cutting plane
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。