IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i11d10.1057_palgrave.jors.2600820.html
   My bibliography  Save this article

Branch-and-price algorithm for a multicast routing problem

Author

Listed:
  • C S Sung

    (Korea Advanced Institute of Science and Technology)

  • J M Hong

    (Korea Advanced Institute of Science and Technology)

Abstract

This paper considers a multicast routing problem to find the minimum cost tree where the whole communication link delay on each path(route) of the tree is subject to a given delay allowance. The problem is formulated as an integer programming problem by using path variables. An associated problem reduction property is then characterised to reduce the solution space. Moreover, a polynomial time column generation procedure is exploited to solve the associated linear programming relaxation with such solution space reduced. Therefore a branch-and-price algorithm is derived to obtain the optimal integer solution(tree) for the problem. Computational results show that the algorithm can solve practical size problems in a reasonable length of time.

Suggested Citation

  • C S Sung & J M Hong, 1999. "Branch-and-price algorithm for a multicast routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(11), pages 1168-1175, November.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:11:d:10.1057_palgrave.jors.2600820
    DOI: 10.1057/palgrave.jors.2600820
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600820
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600820?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. C S Sung & S H Song, 2003. "Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 72-82, January.
    2. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2009. "Optimal multicast route packing," European Journal of Operational Research, Elsevier, vol. 196(1), pages 351-359, July.
    3. C S Sung & H C Rim, 2004. "Receiver set partitioning and sequencing for multicasting traffic in a WDM lightwave single-hop network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 630-639, June.
    4. J W Hearne, 2007. "A market-driven approach to the optimal stocking problem on African game ranches," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 423-428, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:50:y:1999:i:11:d:10.1057_palgrave.jors.2600820. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.