IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v48y2010i4p511-531.html
   My bibliography  Save this article

Optimal placement of UV-based communications relay nodes

Author

Listed:
  • Oleg Burdakov
  • Patrick Doherty
  • Kaj Holmberg
  • Per-Magnus Olsson

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:48:y:2010:i:4:p:511-531
    DOI: 10.1007/s10898-010-9526-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-010-9526-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-010-9526-8?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
    ---><---

    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. 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.
    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. Enrique Machuca & Lawrence Mandow, 2016. "Lower bound sets for biobjective shortest path problems," Journal of Global Optimization, Springer, vol. 64(1), pages 63-77, January.
    2. Saket Navlakha & Anthony Gitter & Ziv Bar-Joseph, 2012. "A Network-based Approach for Predicting Missing Pathway Interactions," PLOS Computational Biology, Public Library of Science, vol. 8(8), pages 1-13, August.
    3. Gabriella Colajanni & Patrizia Daniele & Anna Nagurney & Ladimer S. Nagurney & Daniele Sciacca, 2023. "A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management," Journal of Global Optimization, Springer, vol. 86(3), pages 741-780, July.

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

    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:spr:jglopt:v:48:y:2010:i:4:p:511-531. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.