Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks

Esmaeil Afrashteh, Behrooz Alizadeh () and Fahimeh Baroughi
Additional contact information
Esmaeil Afrashteh: Sahand University of Technology
Behrooz Alizadeh: Sahand University of Technology
Fahimeh Baroughi: Sahand University of Technology

Annals of Operations Research, 2020, vol. 289, issue 2, No 1, 153-172

Abstract: Abstract This paper is concerned with the upgrading selective obnoxious p-median location problem on tree networks in which the existing customer points and the candidate facility locations are assumed to be two selective subsets of the vertex set of the underlying tree. The task is to augment the edge lengths within associated bounds and a budget constraint on the overall modification cost so that the optimal selective obnoxious p-median objective value is maximized under the new edge lengths. Exact optimal algorithms with polynomial time complexities are developed for cases $$p=1 $$p=1 and $$p\ge 2$$p≥2. Moreover, it is shown that if the bound constraints are dropped, then the problems under investigation can be solved in lower times.

Keywords: Obnoxious p-median location; Upgrading problem; Combinatorial optimization; Time complexity; Tree graphs; 90B80; 90B85; 90C27; 90C35 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-020-03561-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:annopr:v:289:y:2020:i:2:d:10.1007_s10479-020-03561-4

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

DOI: 10.1007/s10479-020-03561-4

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