Robust vertex centdian facility location problem on tree networks

Soudabeh Seyyedi Ghomi and Fahimeh Baroughi ()
Additional contact information
Soudabeh Seyyedi Ghomi: Sahand University of Technology
Fahimeh Baroughi: Sahand University of Technology

Annals of Operations Research, 2024, vol. 341, issue 2, No 14, 1135-1149

Abstract: Abstract This paper studies the robust vertex centdian location problem on tree networks with interval edge lengths. To obtain a robust solution, we use the minmax regret criterion. First, we obtain atmost n worst case scenario for each pair of vertices on tree networks. Then we reduce this number to $$ \log n $$ log n . Finally, the total time for obtaining a robust solution is equal to $$ O(n^{4}) $$ O ( n 4 ) . This time is reduced to $$ O(n^{3}\log n) $$ O ( n 3 log n ) by using the property of binary search tree and weighted centroid.

Keywords: Minmax regret; Robust optimization; Minmax criterion; Centdian location problem (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-024-06096-0 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:annopr:v:341:y:2024:i:2:d:10.1007_s10479-024-06096-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-024-06096-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().