Some robust inverse median problems on trees with interval costs

We address the problem of modifying vertex weights of a tree in such an optimal way that a given facility (vertex) becomes a 1-median in the modified tree. Here, each modifying cost receive any value within an interval. As the costs ar.e not exactly known, we apply the concept of absolute robust and...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computational management science Ročník 21; číslo 2; s. 42
Hlavní autori: Dai, Le Xuan, Nguyen, Kien Trung, Thao, Le Phuong, Vui, Pham Thi
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht Springer Nature B.V 01.12.2024
Predmet:
Algorithms
Apexes
Applied mathematics
Chebyshev approximation
Convexity
Cost function
Costs
Criteria
Decision theory
Investigations
Lower bounds
Optimization
Polynomials
Robustness (mathematics)
Trees (mathematics)
Upper bounds
ISSN:1619-697X, 1619-6988
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We address the problem of modifying vertex weights of a tree in such an optimal way that a given facility (vertex) becomes a 1-median in the modified tree. Here, each modifying cost receive any value within an interval. As the costs ar.e not exactly known, we apply the concept of absolute robust and minmax regret criteria to measure the cost functions. We first consider the absolute robust inverse 1-median problem with sum objective function. The duality of the problem helps to know the convexity of the induced univariate minimization problem. Based on the convexity, an O(nlog2n) time algorithm is developed, where n is the number of vertices on the underlying tree. We also apply the minmax regret criteria to the uncertain inverse 1-median problem with Chebyshev norm and bottleneck Hamming distance. It is shown that in the optimal solution there exists exactly one cost coefficient attaining the upper bound and the others attaining their lower bounds. Hence, we develop strongly polynomial-time algorithms for the problems based on this special property.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1619-697X
1619-6988
DOI:10.1007/s10287-024-00522-1