Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A New Mathematical Formulation for Generating a Multicast Routing Tree

  • Published : 2006.11.30
Download PDF
⟨ Previous Next ⟩

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

References

  1. 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 https://doi.org/10.1016/0305-0548(94)00074-I
  2. Gouveia, L., 'Multicommodity flow models for spanning trees with hop constraints,' European Journal of Operational Research 95 (1996), 178-190 https://doi.org/10.1016/0377-2217(95)00090-9
  3. 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 https://doi.org/10.1287/ijoc.10.2.180
  4. 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 https://doi.org/10.1016/S0377-2217(00)00143-0
  5. Chvatal, V., Linear programming, Freeman, New York, 1983
  6. Park, K., S. Kang, and S. Park, 'An integer programming approach to the bandwidth packing problem,' Management Science 42, 9 (1996), 1277-1291 https://doi.org/10.1287/mnsc.42.9.1277