Optimal multicast route packing

DOI10.1016/J.EJOR.2008.03.006MaRDI QIDQ2378485zbMATH OpenOpenAlexFDO

Authors Jangha Kang, Kyungchul Park, Sungsoo Park

Publication date 8 January 2009

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

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

zbMATH Keywords

column generationcutting planeinteger programmingmulticastoptimization

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Branch-and-price algorithm for a multicast routing problem
• Heuristic algorithms for packing of multiple-group multicasting
• Dimensioning multicast-enabled communications networks
• A branch-and-cut to the point-to-point connection problem on multicast networks
• Bandwidth-Delay Constrained Least Cost Multicast Routing for Multimedia Communication

Cites work

• A branch-and-price algorithm for the Steiner tree packing problem.
• A note on the knapsack problem with special ordered sets
• A polyhedral approach to edge coloring
• An Integer Programming Approach to the Bandwidth Packing Problem
• ATM VP-based network design
• Branch-and-price algorithm for a multicast routing problem
• Branch-and-price: Column generation for solving huge integer programs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
• The Steiner tree problem with hop constraints

Cited in

(7)

• A survey of combinatorial optimization problems in multicast routing
• An algorithm to find the link constrained Steiner tree in undirected graphs
• scientific article; zbMATH DE number 2088478 (Why is no real title available?)
• A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
• A branch-and-cut to the point-to-point connection problem on multicast networks
• Heuristic algorithms for packing of multiple-group multicasting
• Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms

This page was built for publication: Optimal multicast route packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378485)