Budget-constrained inverse median facility location problem on tree networks

Behrooz Alizadeh and Esmaeil Afrashteh

Applied Mathematics and Computation, 2020, vol. 375, issue C

Abstract: This paper is concerned with the budget-constrained inverse median facility location problem on networks, in which the underlying vertex set is considered as customer points and the aim is to modify the vertex weights at the minimum overall cost subject to specific modification bounds and an associated budget such that a predetermined vertex becomes an optimal median facility location under the perturbed vertex weights. We develop novel combinatorial algorithms for deriving the optimal solutions of the problem on tree networks under different cost norms.

Keywords: Median facility location; Combinatorial optimization; Inverse optimization; Tree graphs; Time complexity (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320300473
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:375:y:2020:i:c:s0096300320300473

DOI: 10.1016/j.amc.2020.125078

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().