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

Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems

Author

Listed:
  • Suk-Gwon Chang

    (Hanyang University, Seoul, Korea)

  • Bezalel Gavish

    (Vanderbilt University, Nashville, Tennessee)

Abstract

This paper suggests an improved formulation for the multiperiod network topology and capacity expansion problem and proposes new lower bounding schemes based on it. It differs from earlier formulations and solution methods in that entirely new and different subproblems are solved and a number of lower bound tightening schemes are added within the framework of a Lagrangian relaxation. Dual ascent and multiplier adjustment procedures are suggested for the Lagrange multiplier updating procedure. Computational results are reported to demonstrate the tightness of the bounds generated by the suggested procedures. Heuristics based on converting the dual information obtained from the Lagrangian procedure into primal feasible solutions are tested. The tests show that the Lagrangian-based heuristics generate solutions superior to solutions generated by other heuristics proposed in the literature.

Suggested Citation

  • Suk-Gwon Chang & Bezalel Gavish, 1995. "Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems," Operations Research, INFORMS, vol. 43(1), pages 43-57, February.
    • Handle: RePEc:inm:oropre:v:43:y:1995:i:1:p:43-57
    DOI: 10.1287/opre.43.1.43
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.1.43
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.43.1.43?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. Leegwater, D.K. & de Groot, J.D., 2004. "Optimisation of connections to a fibre network," Econometric Institute Research Papers EI 2004-42, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. Gendreau, Michel & Potvin, Jean-Yves & Smires, Ali & Soriano, Patrick, 2006. "Multi-period capacity expansion for a local access telecommunications network," European Journal of Operational Research, Elsevier, vol. 172(3), pages 1051-1066, August.
    4. Flippo, Olaf E. & Kolen, Antoon W. J. & Koster, Arie M. C. A. & van de Leensel, Robert L. M. J., 2000. "A dynamic programming algorithm for the local access telecommunication network expansion problem," European Journal of Operational Research, Elsevier, vol. 127(1), pages 189-202, November.
    5. Ahmed, Shabbir & Sahinidis, Nikolaos V., 2008. "Selection, acquisition, and allocation of manufacturing technology in a multi-period environment," European Journal of Operational Research, Elsevier, vol. 189(3), pages 807-821, September.
    6. 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.
    7. Antonio Frangioni, 2005. "About Lagrangian Methods in Integer Optimization," Annals of Operations Research, Springer, vol. 139(1), pages 163-193, October.
    8. van de Leensel, R.L.J.M. & Flippo, O.E. & Koster, Arie M.C.A. & Kolen, A.W.J., 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    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:43-57. 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.