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

New formulations and solution procedures for the hop constrained network design problem

Author

Listed:
  • Pirkul, Hasan
  • Soni, Samit

Abstract

No abstract is available for this item.

Suggested Citation

  • Pirkul, Hasan & Soni, Samit, 2003. "New formulations and solution procedures for the hop constrained network design problem," European Journal of Operational Research, Elsevier, vol. 148(1), pages 126-140, July.
    • Handle: RePEc:eee:ejores:v:148:y:2003:i:1:p:126-140
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00366-1
    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. Bezalel Gavish & Kemal Altinkemer, 1990. "Backbone Network Design Tools with Economic Tradeoffs," INFORMS Journal on Computing, INFORMS, vol. 2(3), pages 236-252, August.
    2. 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.
    3. Skorin-Kapov, Darko & Skorin-Kapov, Jadranka & O'Kelly, Morton, 1996. "Tight linear programming relaxations of uncapacitated p-hub median problems," European Journal of Operational Research, Elsevier, vol. 94(3), pages 582-593, November.
    4. Hasan Pirkul & David A. Schilling, 1998. "An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems," Management Science, INFORMS, vol. 44(12-Part-2), pages 235-242, December.
    5. Luis Gouveia, 1998. "Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 180-188, May.
    6. Hasan Pirkul & Sridhar Narasimhan, 1994. "Primary and Secondary Route Selection in Backbone Computer Networks," INFORMS Journal on Computing, INFORMS, vol. 6(1), pages 50-60, February.
    7. Anantaram Balakrishnan & Thomas L. Magnanti & Prakash Mirchandani, 1998. "Designing Hierarchical Survivable Networks," Operations Research, INFORMS, vol. 46(1), pages 116-136, February.
    8. Larry J. LeBlanc & Jerome Chifflet & Philippe Mahey, 1999. "Packet Routing in Telecommunication Networks with Path and Flow Restrictions," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 188-197, May.
    9. Amiri, Ali & Pirkul, Hasan, 1996. "Primary and secondary route selection in backbone communication networks," European Journal of Operational Research, Elsevier, vol. 93(1), pages 98-109, August.
    10. Anantaram Balakrishnan & Thomas L. Magnanti & Prakash Mirchandani, 1996. "Heuristics, LPs, and Trees on Trees: Network Design Analyses," Operations Research, INFORMS, vol. 44(3), pages 478-496, June.
    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. Grigory Pastukhov & Alexander Veremyev & Vladimir Boginski & Eduardo L. Pasiliao, 2014. "Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks," Journal of Combinatorial Optimization, Springer, vol. 27(3), pages 462-486, April.
    2. Oleg Burdakov & Patrick Doherty & Kaj Holmberg & Per-Magnus Olsson, 2010. "Optimal placement of UV-based communications relay nodes," Journal of Global Optimization, Springer, vol. 48(4), pages 511-531, December.
    3. De Boeck, Jérôme & Fortz, Bernard, 2018. "Extended formulation for hop constrained distribution network configuration problems," European Journal of Operational Research, Elsevier, vol. 265(2), pages 488-502.
    4. Quentin Botton & Bernard Fortz & Luis Gouveia & Michael Poss, 2013. "Benders Decomposition for the Hop-Constrained Survivable Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 13-26, February.
    5. 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.
    6. Akgün, Ibrahim & Tansel, Barbaros Ç., 2011. "New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints," European Journal of Operational Research, Elsevier, vol. 212(2), pages 263-276, July.
    7. BOTTON, Quentin & FORTZ, Bernard & GOUVEIA, Luis & POSS, Michael, 2011. "Benders decomposition for the hop-constrained survivable network design problem," LIDAM Discussion Papers CORE 2011037, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    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. 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.
    2. An, Yu & Zhang, Yu & Zeng, Bo, 2015. "The reliable hub-and-spoke design problem: Models and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 103-122.
    3. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2012. "Hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 529-543.
    4. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    5. Altinkemer, Kemal & Bose, Indranil, 2003. "Asynchronous transfer mode networks with parallel links and multiple service classes," European Journal of Operational Research, Elsevier, vol. 146(1), pages 181-198, April.
    6. Matsubayashi, Nobuo & Umezawa, Masashi & Masuda, Yasushi & Nishino, Hisakazu, 2005. "A cost allocation problem arising in hub-spoke network systems," European Journal of Operational Research, Elsevier, vol. 160(3), pages 821-838, February.
    7. Amiri, Ali & Pirkul, Hasan, 1996. "Primary and secondary route selection in backbone communication networks," European Journal of Operational Research, Elsevier, vol. 93(1), pages 98-109, August.
    8. Ali Amiri & Hasan Pirkul, 1997. "Routing in packet‐switched communication networks with different criticality classes of communicating node pairs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(5), pages 485-505, August.
    9. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2019. "Alternate Solution Approaches for Competitive Hub Location Problems," IIMA Working Papers WP 2019-12-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    10. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    11. Amiri, Ali & Pirkul, Hasan, 1999. "Routing and capacity assignment in backbone communication networks under time varying traffic conditions," European Journal of Operational Research, Elsevier, vol. 117(1), pages 15-29, August.
    12. Dhyani, Sneha & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2019. "Alternate Second Order Conic Programming Reformulations for Hub Location with Capacity Selection under Demand," IIMA Working Papers WP 2018-12-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    13. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2021. "Alternate solution approaches for competitive hub location problems," European Journal of Operational Research, Elsevier, vol. 290(1), pages 68-80.
    14. Samir Elhedhli & Huyu Wu, 2010. "A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 282-296, May.
    15. Akgün, Ibrahim & Tansel, Barbaros Ç., 2011. "New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints," European Journal of Operational Research, Elsevier, vol. 212(2), pages 263-276, July.
    16. Yaman, Hande, 2009. "The hierarchical hub median problem with single assignment," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 643-658, July.
    17. Yaman, Hande, 2011. "Allocation strategies in hub networks," European Journal of Operational Research, Elsevier, vol. 211(3), pages 442-451, June.
    18. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2021. "Competitive hub location problem: Model and solution approaches," Transportation Research Part B: Methodological, Elsevier, vol. 146(C), pages 237-261.
    19. Adler, Nicole & Berechman, Joseph, 2001. "Evaluating optimal multi-hub networks in a deregulated aviation market with an application to Western Europe," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(5), pages 373-390, June.
    20. Costa, Alysson M. & Cordeau, Jean-François & Laporte, Gilbert, 2008. "Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints," European Journal of Operational Research, Elsevier, vol. 190(1), pages 68-78, October.

    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:148:y:2003:i:1:p:126-140. 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.