The reverse selective balance center location problem on trees

Nguyen Thanh Toan (), Huy Minh Le () and Kien Trung Nguyen ()
Additional contact information
Nguyen Thanh Toan: University of Science
Huy Minh Le: Van Lang University
Kien Trung Nguyen: Can Tho University

OPSEARCH, 2024, vol. 61, issue 1, No 22, 483-497

Abstract: 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.

Keywords: Location problem; Reverse location; Balanced facility; Selective network; Tree; 90B80; 90C35; 90C27 (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-023-00706-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:61:y:2024:i:1:d:10.1007_s12597-023-00706-4

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-023-00706-4

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().