IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v172y2006i3p1051-1066.html
   My bibliography  Save this article

Multi-period capacity expansion for a local access telecommunications network

Author

Listed:
  • Gendreau, Michel
  • Potvin, Jean-Yves
  • Smires, Ali
  • Soriano, Patrick

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:172:y:2006:i:3:p:1051-1066
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00014-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. P. J. Doulliez & M. R. Rao, 1975. "Optimal Network Capacity Planning: A Shortest-Path Scheme," Operations Research, INFORMS, vol. 23(4), pages 810-818, August.
    2. 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.
    3. Anantaram Balakrishnan & Thomas L. Magnanti & Richard T. Wong, 1995. "A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning," Operations Research, INFORMS, vol. 43(1), pages 58-76, February.
    4. Amitava Dutta & Jay-Ick Lim, 1992. "A Multiperiod Capacity Planning Model for Backbone Computer Communication Networks," Operations Research, INFORMS, vol. 40(4), pages 689-705, August.
    5. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Martins, Carlos Lúcio & Fonseca, Maria da Conceição & Pato, Margarida Vaz, 2017. "Modeling the Steering of International Roaming Traffic," European Journal of Operational Research, Elsevier, vol. 261(2), pages 735-754.
    2. Canca, David & Andrade-Pineda, José Luis & De-Los-Santos, Alicia & González-R, Pedro Luis, 2021. "A quantitative approach for the long-term assessment of Railway Rapid Transit network construction or expansion projects," European Journal of Operational Research, Elsevier, vol. 294(2), pages 604-621.
    3. Lixin Tang & Wei Jiang & Georgios Saharidis, 2013. "An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions," Annals of Operations Research, Springer, vol. 210(1), pages 165-190, November.
    4. Corte-Real, Margarida & Gouveia, Luís, 2010. "A node rooted flow-based model for the local access network expansion problem," European Journal of Operational Research, Elsevier, vol. 204(1), pages 20-34, July.
    5. Andreas Bärmann & Alexander Martin & Hanno Schülldorf, 2017. "A Decomposition Method for Multiperiod Railway Network Expansion—With a Case Study for Germany," Transportation Science, INFORMS, vol. 51(4), pages 1102-1121, November.
    6. Sun, Yanshuo & Schonfeld, Paul, 2015. "Stochastic capacity expansion models for airport facilities," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 1-18.
    7. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2016. "An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 95-123.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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).
    2. Corte-Real, Margarida & Gouveia, Luís, 2010. "A node rooted flow-based model for the local access network expansion problem," European Journal of Operational Research, Elsevier, vol. 204(1), pages 20-34, July.
    3. 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.
    4. Mohit Tawarmalani & Yanjun Li, 2011. "Multi‐period maintenance scheduling of tree networks with minimum flow disruption," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(5), pages 507-530, August.
    5. Martins, Carlos Lúcio & Fonseca, Maria da Conceição & Pato, Margarida Vaz, 2017. "Modeling the Steering of International Roaming Traffic," European Journal of Operational Research, Elsevier, vol. 261(2), pages 735-754.
    6. İlker Baybars & Richard H. Edahl, 1988. "A heuristic method for facility planning in telecommunications networks with multiple alternate routes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(4), pages 503-528, August.
    7. Yazar, Başak & Arslan, Okan & Karaşan, Oya Ekin & Kara, Bahar Y., 2016. "Fiber optical network design problems: A case for Turkey," Omega, Elsevier, vol. 63(C), pages 23-40.
    8. Garcia, Bruno-Laurent & Mahey, Philippe & LeBlanc, Larry J., 1998. "Iterative improvement methods for a multiperiod network design problem," European Journal of Operational Research, Elsevier, vol. 110(1), pages 150-165, October.
    9. S Mudchanatongsuk & F Ordóñez & J Liu, 2008. "Robust solutions for network design under transportation cost and demand uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 652-662, May.
    10. 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.
    11. Hanan Luss, 2010. "Equitable bandwidth allocation in content distribution networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(3), pages 266-278, April.
    12. Antonio Frangioni, 2005. "About Lagrangian Methods in Integer Optimization," Annals of Operations Research, Springer, vol. 139(1), pages 163-193, October.
    13. Costamagna, Eugenio & Fanni, Alessandra & Giacinto, Giorgio, 1998. "A Tabu Search algorithm for the optimisation of telecommunication networks," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 357-372, April.
    14. Scheibe, Kevin P. & Ragsdale, Cliff T., 2009. "A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 773-784, September.
    15. Daeki Kim & Cynthia Barnhart & Keith Ware & Gregory Reinhardt, 1999. "Multimodal Express Package Delivery: A Service Network Design Application," Transportation Science, INFORMS, vol. 33(4), pages 391-407, November.
    16. Daniel Bienstock & Olga Raskina & Iraj Saniee & Qiong Wang, 2006. "Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation," Operations Research, INFORMS, vol. 54(2), pages 261-276, April.
    17. Linos F. Frantzeskakis & Hanan Luss, 1999. "The network redesign problem for access telecommunications networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 487-506, August.
    18. 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.
    19. Gouveia, Luis & Lopes, Maria Joao, 2000. "Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs," European Journal of Operational Research, Elsevier, vol. 121(2), pages 394-411, March.
    20. Majid Taghavi & Kai Huang, 2016. "A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 600-614, December.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:172:y:2006:i:3:p:1051-1066. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.