IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v38y2021i04ns0217595921500019.html
   My bibliography  Save this article

Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Author

Listed:
  • Mehran Hasanzadeh

    (Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran)

  • Behrooz Alizadeh

    (Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran)

  • Esmaeil Afrashteh

    (Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran)

  • Fahimeh Baroughi

    (Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran)

Abstract

This paper deals with the inverse eccentric vertex location problem on extended star networks in which the aim is to modify the edge lengths at the minimum overall cost within certain modification bounds so that a predetermined vertex becomes the farthest vertex from a given fixed vertex under the new edge lengths. Novel combinatorial algorithms with near-linear time complexities are developed for obtaining the optimal solution of the problem under different cost norms.

Suggested Citation

  • Mehran Hasanzadeh & Behrooz Alizadeh & Esmaeil Afrashteh & Fahimeh Baroughi, 2021. "Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 38(04), pages 1-19, August.
    • Handle: RePEc:wsi:apjorx:v:38:y:2021:i:04:n:s0217595921500019
    DOI: 10.1142/S0217595921500019
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595921500019
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595921500019?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.

    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:wsi:apjorx:v:38:y:2021:i:04:n:s0217595921500019. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.