Browse > Article

A New Mathematical Formulation for Generating a Multicast Routing Tree  

Kang, Jang-Ha (SCM Group, Entrue Consulting Partners)
Kang, Dong-Han (Samsung Electro-Mechanics)
Park, Sung-Soo (Dept. of Industrial Engineering, Korea Advanced Institute of Science and Technology)
Publication Information
Management Science and Financial Engineering / v.12, no.2, 2006 , pp. 63-69 More about this Journal
Abstract
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.
Keywords
Multicasting; Steiner Tree; Column Generation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Gouveia, L., 'Multicommodity flow models for spanning trees with hop constraints,' European Journal of Operational Research 95 (1996), 178-190   DOI   ScienceOn
2 Gouveia, L. and C. Requejo, 'A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem,' European Journal of Operational Research 132 (2001), 539-552   DOI   ScienceOn
3 Gouveia, L., 'Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints,' Computers and Operations Research 22, 9 (1995), 959-970   DOI   ScienceOn
4 Park, K., S. Kang, and S. Park, 'An integer programming approach to the bandwidth packing problem,' Management Science 42, 9 (1996), 1277-1291   DOI   ScienceOn
5 Gouveia, L., 'Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints,' INFORMS Journal on Computing 10, 2 (1998), 180-188   DOI   ScienceOn
6 Chvatal, V., Linear programming, Freeman, New York, 1983