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

A multi-period network design problem for cellular telecommunication systems

Author

Listed:
  • Kubat, Peter
  • Smith, J. MacGregor

Abstract

No abstract is available for this item.

Suggested Citation

  • Kubat, Peter & Smith, J. MacGregor, 2001. "A multi-period network design problem for cellular telecommunication systems," European Journal of Operational Research, Elsevier, vol. 134(2), pages 439-456, October.
    • Handle: RePEc:eee:ejores:v:134:y:2001:i:2:p:439-456
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00271-X
    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. Dutta, Amitava & Kubat, Peter, 1999. "Design of partially survivable networks for cellular telecommunication systems," European Journal of Operational Research, Elsevier, vol. 118(1), pages 52-64, October.
    2. Pisinger, David, 1999. "An exact algorithm for large multiple knapsack problems," European Journal of Operational Research, Elsevier, vol. 114(3), pages 528-541, May.
    3. Thomas L. Magnanti & Prakash Mirchandani & Rita Vachani, 1995. "Modeling and Solving the Two-Facility Capacitated Network Loading Problem," Operations Research, INFORMS, vol. 43(1), pages 142-157, February.
    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. Jean André & Stéphane Auray & Daniel de Wolf & Mohamed-Mahmoud Memmah & Antoine Simonnet, 2014. "Time development of new hydrogen transmission pipeline networks for France," Post-Print halshs-02396799, HAL.
    2. André, Jean & Auray, Stéphane & Brac, Jean & De Wolf, Daniel & Maisonnier, Guy & Ould-Sidi, Mohamed-Mahmoud & Simonnet, Antoine, 2013. "Design and dimensioning of hydrogen transmission pipeline networks," European Journal of Operational Research, Elsevier, vol. 229(1), pages 239-251.

    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. C S Sung & S H Song, 2003. "Integrated service network design for a cross-docking supply chain network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1283-1295, December.
    2. Tomohiko Mizutani & Makoto Yamashita, 2013. "Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables," Journal of Global Optimization, Springer, vol. 56(3), pages 1073-1100, July.
    3. Liang Chen & Wei-Kun Chen & Mu-Ming Yang & Yu-Hong Dai, 2021. "An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron," Journal of Global Optimization, Springer, vol. 81(3), pages 659-689, November.
    4. Yogesh Agarwal, 2013. "Design of Survivable Networks Using Three- and Four-Partition Facets," Operations Research, INFORMS, vol. 61(1), pages 199-213, February.
    5. Luís Gouveia & Pedro Patrício & Amaro Sousa, 2008. "Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM," Networks and Spatial Economics, Springer, vol. 8(1), pages 3-21, March.
    6. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    7. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    8. Mancini, Simona & Ciavotta, Michele & Meloni, Carlo, 2021. "The Multiple Multidimensional Knapsack with Family-Split Penalties," European Journal of Operational Research, Elsevier, vol. 289(3), pages 987-998.
    9. Sylvie Borne & Eric Gourdin & Bernard Liau & A. Mahjoub, 2006. "Design of survivable IP-over-optical networks," Annals of Operations Research, Springer, vol. 146(1), pages 41-73, September.
    10. Stefan Hajkowicz & Andrew Higgins & Kristen Williams & Daniel P. Faith & Michael Burton, 2007. "Optimisation and the selection of conservation contracts," Australian Journal of Agricultural and Resource Economics, Australian Agricultural and Resource Economics Society, vol. 51(1), pages 39-56, March.
    11. Babonneau, F. & Vial, J.-P., 2010. "A partitioning algorithm for the network loading problem," European Journal of Operational Research, Elsevier, vol. 204(1), pages 173-179, July.
    12. Yamada, Takeo & Takeoka, Takahiro, 2009. "An exact algorithm for the fixed-charge multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 192(2), pages 700-705, January.
    13. Mirchandani, Prakash, 2000. "Projections of the capacitated network loading problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 534-560, May.
    14. Agarwal, Y.K. & Venkateshan, Prahalad, 2014. "Survivable network design with shared-protection routing," European Journal of Operational Research, Elsevier, vol. 238(3), pages 836-845.
    15. Sridhar, Varadharajan & Park, June S., 2000. "Benders-and-cut algorithm for fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 125(3), pages 622-632, September.
    16. Martello, Silvano & Monaci, Michele, 2020. "Algorithmic approaches to the multiple knapsack assignment problem," Omega, Elsevier, vol. 90(C).
    17. WOLSEY, Laurence & YAMAN , Hand & ,, 2013. "Continuous knapsack sets with divisible capacities," LIDAM Discussion Papers CORE 2013063, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    18. Ang, James S.K. & Cao, Chengxuan & Ye, Heng-Qing, 2007. "Model and algorithms for multi-period sea cargo mix problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1381-1393, August.
    19. Andrew P. Armacost & Cynthia Barnhart & Keith A. Ware, 2002. "Composite Variable Formulations for Express Shipment Service Network Design," Transportation Science, INFORMS, vol. 36(1), pages 1-20, February.
    20. M Hifi & M Michrafy & A Sbihi, 2004. "Heuristic algorithms for the multiple-choice multidimensional knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1323-1332, 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:134:y:2001:i:2:p:439-456. 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.