论文信息 - A New Mathematical Formulation for Generating a Multicast Routing Tree

A New Mathematical Formulation for Generating a Multicast Routing Tree

To generate a multicast routing tree guaranteeing the quality of service (QoS), we consider the hop constrained Steiner tree problem and propose a new mathematical formulation for it, which contains fewer constraints than a known formulation. An efficient procedure is also proposed to solve the problem. Preliminary tests show that the procedure reduces the computing time significantly.

Donghan Kang | Sungsoo Park | Jangha Kang

[1] Sungsoo Park,et al. An Integer Programming Approach to the Bandwidth Packing Problem , 1996 .

[2] Luís Gouveia,et al. Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints , 1998, INFORMS J. Comput..

[3] L. Gouveia. Multicommodity flow models for spanning trees with hop constraints , 1996 .

[4] Luís Gouveia,et al. Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints , 1995, Comput. Oper. Res..

[5] Soondal Park,et al. On Finding a Convenient Path in the Hierarchical Road Network , 2006 .

[6] Yuval Rabani,et al. Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[7] Luís Gouveia,et al. A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem , 2001, Eur. J. Oper. Res..