IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v43y1995i1p187-190.html
   My bibliography  Save this article

An Efficient Algorithm for the Multiperiod Capacity Expansion of One Location in Telecommunications

Author

Listed:
  • Iraj Saniee

    (Bell Communications Research, Morristown, New Jersey)

Abstract

The minimum cost multiperiod capacity expansion of one location in telecommunications network planning can be formulated as a time-dependent knapsack problem. The problem consists of meeting integral demands at distinct time periods at minimum total discounted cost through a selection of items (with integral costs and capacities) from a collection of N distinct types of objects. This note presents an efficient pseudopolynomial time solution to this time-dependent knapsack problem. The technique involves an initial dynamic programming run with time complexity O(N(D + C)) followed by a shortest path algorithm with worst-case time complexity O(C 2T ) through a suitably defined network, where D and C are the maxima of the values of the demands and capacities, and T is the number of time periods to be considered. The application of this technique to the problem of optimal capacity expansion of one location in telecommunications network planning is described and computational results are reported.

Suggested Citation

  • Iraj Saniee, 1995. "An Efficient Algorithm for the Multiperiod Capacity Expansion of One Location in Telecommunications," Operations Research, INFORMS, vol. 43(1), pages 187-190, February.
    • Handle: RePEc:inm:oropre:v:43:y:1995:i:1:p:187-190
    DOI: 10.1287/opre.43.1.187
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.1.187
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.43.1.187?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
    ---><---

    Citations

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


    Cited by:

    1. Pablo Cortes & Jesus Muñuzuri & Luis Onieva & Juan Larrañeta & Juan M. Vozmediano & Jose C. Alarcon, 2006. "Andalucía Assesses the Investment Needed to Deploy a Fiber-Optic Network," Interfaces, INFORMS, vol. 36(2), pages 105-117, April.
    2. Manuel Laguna, 1998. "Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty," Management Science, INFORMS, vol. 44(11-Part-2), pages 101-110, November.
    3. Shabbir Ahmed & Nikolaos V. Sahinidis, 2003. "An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion," Operations Research, INFORMS, vol. 51(3), pages 461-471, June.
    4. Gang Li & Joy M. Field & Hongxun Jiang & Tian He & Youming Pang, 2019. "Decision Models for Workforce and Technology Planning in Services," Papers 1909.12829, arXiv.org.

    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:inm:oropre:v:43:y:1995:i:1:p:187-190. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.