IDEAS home Printed from https://ideas.repec.org/a/ids/injams/v1y2008i2p176-197.html
   My bibliography  Save this article

Least cost route planning DSS for telecommunication operators

Author

Listed:
  • Sydney C.K. Chu
  • S.S. Lam

Abstract

This article employs a mathematical programming model to solve the capacity planning problem of international direct dialling (IDD) services. Our study involves allocating forecasted IDD demand traffic to destination countries via partner suppliers at minimum cost. To facilitate its use, the model has been integrated into a decision support system (DSS). Evaluating the data provided by a telecommunication operators shows that the system can handle the problem very effectively and efficiently.

Suggested Citation

  • Sydney C.K. Chu & S.S. Lam, 2008. "Least cost route planning DSS for telecommunication operators," International Journal of Applied Management Science, Inderscience Enterprises Ltd, vol. 1(2), pages 176-197.
    • Handle: RePEc:ids:injams:v:1:y:2008:i:2:p:176-197
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=21100
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:injams:v:1:y:2008:i:2:p:176-197. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=286 .

    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.