Optimal multicast route packing-Reference-Cited by-同舟云学术

Optimal multicast route packing

Published:2009-07 Issue:1 Volume:196 Page:351-359
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Kang Jangha,Park Kyungchul,Park Sungsoo

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference19 articles.

1. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems;Barnhart;Operations Research,2000

2. Branch-and-price: Column generation for solving huge integer programs;Barnhart;Operations Research,1998

3. The multicast packing problem;Chen;IEEE/ACM Transactions on Networking,1999

4. Efficient multicast routing with delay constraints;Feng;International Journal of Communication Systems,1999

5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

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

1. Optimizing co-existing multicast routing trees in IP network via discrete artificial fish school algorithm;Knowledge-Based Systems;2020-03

2. A Lagrangean-based decomposition approach for the link constrained Steiner tree problem;Optimization Methods and Software;2017-11-03

3. Expert-guided evolutionary algorithm for layout design of complex space stations;Enterprise Information Systems;2016-02-23

4. An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs;Mathematical Software – ICMS 2016;2016

5. Redundant multicast routing in multilayer networks with shared risk resource groups: Complexity, models and algorithms;Computers & Operations Research;2010-10