IDEAS home Printed from
   My bibliography  Save this article

A node rooted flow-based model for the local access network expansion problem


  • Corte-Real, Margarida
  • Gouveia, Luís


In this paper, we present a new formulation for the local access network expansion problem. Previously, we have shown that this problem can be seen as an extension of the well-known Capacitated Minimum Spanning Tree Problem and have presented and tested two flow-based models. By including additional information on the definition of the variables, we propose a new flow-based model that permits us to use effectively variable eliminations tests as well as coefficient reduction on some of the constraints. We present computational results for instances with up to 500 nodes in order to show the advantages of the new model in comparison with the others.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:204:y:2010:i:1:p:20-34

    Download full text from publisher

    File URL:
    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

    1. 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.
    2. 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.
    3. 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)


    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:204:y:2010:i:1:p:20-34. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.