IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v61y2024i1d10.1007_s12597-023-00706-4.html
   My bibliography  Save this article

The reverse selective balance center location problem on trees

Author

Listed:
  • Nguyen Thanh Toan

    (University of Science
    Vietnam National University
    Vinh Long University of Technology Education)

  • Huy Minh Le

    (Van Lang University)

  • Kien Trung Nguyen

    (Can Tho University)

Abstract

The classically balanced facility location problems aim to find the location of one or several new facilities such that some balanced function is optimized. This paper concerns the problem of improving the balanced objective at a prespecified vertex of a tree as much as possible within a given budget. We call such a problem the reverse selective balance center location problem on trees. All vertices are partitioned into two disjoint sets, in which one set consists of selective vertices. The balanced function is considered to be the difference in distance between the furthest demand point in the selective set and the nearest one in the remaining set. We first formulate the problem as linear programming. Then we propose a strategy to reduce the objective value in the case of variable edge lengths. An algorithm is developed to solve the reverse selective balance center location problem on trees in quadratic time.

Suggested Citation

  • Nguyen Thanh Toan & Huy Minh Le & Kien Trung Nguyen, 2024. "The reverse selective balance center location problem on trees," OPSEARCH, Springer;Operational Research Society of India, vol. 61(1), pages 483-497, March.
    • Handle: RePEc:spr:opsear:v:61:y:2024:i:1:d:10.1007_s12597-023-00706-4
    DOI: 10.1007/s12597-023-00706-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-023-00706-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-023-00706-4?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:spr:opsear:v:61:y:2024:i:1:d:10.1007_s12597-023-00706-4. 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: 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.